Titlebook: Computational Collective Intelligence. Technologies and Applications; Second International Jeng-Shyang Pan,Shyi-Ming Chen,Ngoc Thanh Nguyen

浮雕宝石

cyanosis

compassion

Lecture Notes in Computer Scienceg the maximum influence club. For an .-node graph, the worst-case time complexity is .(.. 1.6.), and it is much more efficient in practical: a graph of 200 nodes can be processed within 2 minutes. The performance compared to .-clubs are tested on random graphs and real data. The experimental results also show the advantages of the influence clubs.

Medicare

apiary

关节炎

Terminology, Problems, and Design Issuesilar pairs to define various types of similarity measures and construct the association graph to calculate the similarity between videos. By providing different level types of similarity between videos, our proposed similarity retrieval algorithm has discrimination power about different criteria.

DRILL

Zhuo Cheng,Haitao Zhang,Yasuo Tan,Yuto Limnds opinion leaders in a cyber social network. We consider a social network of users who rate musics and identify representative users of the social network. Then, we verify the correctness of the proposed algorithm by the T-test.

ANNUL

arousal

突袭

Structured Peer-to-Peer Systems reduces the cost system developers need to spend in constructing and maintaining the system. This study uses web service components developed with Microsoft .NET and XML to construct a teaching platform with standard specifications under SOA, allowing system developers to rapidly construct an e-learning system based on web services.