Sciweavers

222 search results - page 26 / 45
» Symmetry and Search in a Network Design Problem
Sort
View
91
Voted
WWW
2004
ACM
16 years 2 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
CEC
2010
IEEE
15 years 3 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
114
Voted
CIKM
2004
Springer
15 years 7 months ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi
121
Voted
SIGCOMM
2010
ACM
15 years 2 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...
PVLDB
2010
152views more  PVLDB 2010»
15 years 8 days ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...