Sciweavers

102 search results - page 16 / 21
» Compact Forbidden-Set Routing
Sort
View
TKDE
2010
152views more  TKDE 2010»
13 years 9 months ago
Maintaining Recursive Views of Regions and Connectivity in Networks
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
EJWCN
2011
133views more  EJWCN 2011»
13 years 5 months ago
CARNIVORE: A Disruption-Tolerant System for Studying Wildlife
—This paper presents CARNIVORE, a system for in-situ, yet unobtrusive monitoring of cryptic, difficult-tocatch/observe wildlife in their natural habitat. CARNIVORE consists of a...
Matthew Rutishauser, Vladislav Petkov, Jay Boice, ...
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 5 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 3 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
CCS
2010
ACM
13 years 11 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper