Sciweavers

2498 search results - page 449 / 500
» Algorithms for the Topological Watershed
Sort
View
WS
2004
ACM
14 years 1 months ago
SeRLoc: secure range-independent localization for wireless sensor networks
In many applications of wireless sensor networks (WSN), sensors are deployed un-tethered in hostile environments. For locationaware WSN applications, it is essential to ensure tha...
Loukas Lazos, Radha Poovendran
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 22 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
ICS
2009
Tsinghua U.
14 years 14 days ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 6 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 5 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz