Sciweavers

2842 search results - page 96 / 569
» Expansion and Search in Networks
Sort
View
OPODIS
2004
15 years 3 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
TKDE
2008
132views more  TKDE 2008»
15 years 1 months ago
Distributed Suffix Tree Overlay for Peer-to-Peer Search
Establishing an appropriate semantic overlay on peer-to-peer (P2P) networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limit...
Hai Zhuge, Liang Feng
SIROCCO
2004
15 years 3 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
EDBT
2012
ACM
291views Database» more  EDBT 2012»
13 years 4 months ago
Relevance search in heterogeneous networks
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...
Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie...
BMCBI
2004
185views more  BMCBI 2004»
15 years 1 months ago
Linear fuzzy gene network models obtained from microarray data by exhaustive search
Background: Recent technological advances in high-throughput data collection allow for experimental study of increasingly complex systems on the scale of the whole cellular genome...
Bahrad A. Sokhansanj, J. Patrick Fitch, Judy N. Qu...