Sciweavers

1541 search results - page 119 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
JGAA
2007
135views more  JGAA 2007»
15 years 4 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
15 years 11 months ago
The Cost of Reality: Effects of Real-World Factors on Multi-Robot Search
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
Jim Pugh, Alcherio Martinoli
ASUNAM
2009
IEEE
15 years 11 months ago
Social Network Discovery Based on Sensitivity Analysis
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
Tarik Crnovrsanin, Carlos D. Correa, Kwan-Liu Ma
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
15 years 4 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
TON
2008
149views more  TON 2008»
15 years 4 months ago
Building heterogeneous peer-to-peer networks: protocol and analysis
In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts--the joining process and the reb...
Kin Wah Kwong, Danny H. K. Tsang