Sciweavers

2292 search results - page 314 / 459
» Hierarchical approximation and localization
Sort
View
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
INFOCOM
2007
IEEE
16 years 1 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
IROS
2007
IEEE
135views Robotics» more  IROS 2007»
16 years 1 months ago
Power-SLAM: A linear-complexity, consistent algorithm for SLAM
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
Esha D. Nerurkar, Stergios I. Roumeliotis
3DPVT
2006
IEEE
202views Visualization» more  3DPVT 2006»
16 years 1 months ago
Visual Shapes of Silhouette Sets
Shape from silhouette methods are extensively used to model dynamic and non-rigid objects using binary foreground-background images. Since the problem of reconstructing shapes fro...
Jean-Sébastien Franco, Marc Lapierre, Edmon...
187
Voted
SSDBM
2006
IEEE
139views Database» more  SSDBM 2006»
16 years 1 months ago
Sampling Trajectory Streams with Spatiotemporal Criteria
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...