Sciweavers

6365 search results - page 391 / 1273
» Fast Local Computation Algorithms
Sort
View
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
16 years 1 months ago
Distributed cut detection in sensor networks
— We propose a distributed algorithm to detect “cuts” in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The alg...
Prabir Barooah
ARCS
2006
Springer
15 years 10 months ago
Power-Aware Collective Tree Exploration
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
IJFCS
2006
82views more  IJFCS 2006»
15 years 6 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
BROADNETS
2006
IEEE
16 years 26 days ago
Sensor Localization and Camera Calibration in Distributed Camera Sensor Networks
— Camera sensors constitute an information rich sensing modality with many potential applications in sensor networks. Their effectiveness in a sensor network setting however grea...
Andrew Barton-Sweeney, Dimitrios Lymberopoulos, An...
CAD
2006
Springer
15 years 6 months ago
Trimming local and global self-intersections in offset curves/surfaces using distance maps
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim