1493 search results - page 8 / 299 » Local resilience of graphs |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Neighbor discovery is a fundamental requirement and need be done frequently in underwater acoustic networks (UANs) with floating node mobility. In hostile environments, neighbo...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...