Sciweavers

6365 search results - page 139 / 1273
» Fast Local Computation Algorithms
Sort
View
IPPS
2007
IEEE
15 years 11 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
15 years 10 months ago
A Robust Localization Algorithm for Mobile Robots with Laser Range Finders
– We present a robust localization algorithm for mobile robots with laser range finders, which takes featurebased approach for reliable matching process as well as pointbased app...
Hee Jin Sohn, Byung Kook Kim
MOBIHOC
2001
ACM
16 years 4 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
TCS
2008
15 years 4 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
CIS
2005
Springer
15 years 10 months ago
A Novel Multi-stage 3D Medical Image Segmentation: Methodology and Validation
Abstract. In this paper, we present a novel multi-stage algorithm for 3D medical image segmentation that is inspired by an improved Fast Marching method and a morphological reconst...
Jianfeng Xu, Lixu Gu, Xiahai Zhuang, Terry M. Pete...