Sciweavers

499 search results - page 31 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
APIN
2007
118views more  APIN 2007»
13 years 7 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
UAI
2004
13 years 9 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
ASUNAM
2011
IEEE
12 years 7 months ago
Evolutionary Clustering and Analysis of Bibliographic Networks
—In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering...
Manish Gupta, Charu C. Aggarwal, Jiawei Han, Yizho...
WWW
2004
ACM
14 years 8 months ago
Small world peer networks in distributed web search
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
Ruj Akavipat, Le-Shin Wu, Filippo Menczer
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...