Sciweavers

1866 search results - page 161 / 374
» Robust Algorithms and Price of Robustness in Shunting Proble...
Sort
View
ICWN
2003
15 years 8 months ago
Localization in Wireless Sensor Networks: A Probabilistic Approach
— In this paper we consider a probabilistic approach to the problem of localization in wireless sensor networks and propose a distributed algorithm that helps unknown nodes to de...
Vaidyanathan Ramadurai, Mihail L. Sichitiu
ICCCN
2007
IEEE
15 years 6 months ago
Online Selection of Tracking Features using AdaBoost
In this paper, a novel feature selection algorithm for object tracking is proposed. This algorithm performs more robust than the previous works by taking the correlation between f...
Ying-Jia Yeh, Chiou-Ting Hsu
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 1 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng

Publication
364views
16 years 1 months ago
CV-SLAM: A new ceiling vision-based SLAM technique
We propose a fast and robust CV-SLAM (Ceiling Vision –based Simultaneous Localization and Mapping) technique using a single ceiling vision sensor. The proposed algorithm is suita...
Woo Yeon Jeong (Seoul National University), Kyoung...
ICASSP
2008
IEEE
16 years 1 months ago
Reconstructing sparse signals from their zero crossings
Classical sampling records the signal level at pre-determined time instances, usually uniformly spaced. An alternative implicit sampling model is to record the timing of pre-deter...
Petros Boufounos, Richard G. Baraniuk