Sciweavers

2489 search results - page 294 / 498
» On the Subgroup Distance Problem
Sort
View
ICASSP
2009
IEEE
15 years 11 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...
IROS
2009
IEEE
198views Robotics» more  IROS 2009»
15 years 11 months ago
Generalized velocity obstacles
— We address the problem of real-time navigation in dynamic environments for car-like robots. Our approach generalizes the concept of velocity obstacles, which have been used for...
David Wilkie, Jur P. van den Berg, Dinesh Manocha
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
15 years 11 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
CAIP
2009
Springer
200views Image Analysis» more  CAIP 2009»
15 years 11 months ago
Recognition-Based Segmentation of Nom Characters from Body Text Regions of Stele Images Using Area Voronoi Diagram
Segmentation of Nom characters from body text regions of stele images is a challenging problem due to the confusing spatial distribution of the connected components composing these...
Thai V. Hoang, Salvatore Tabbone, Ngoc-Yen Pham
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 11 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...