Sciweavers

1016 search results - page 168 / 204
» Generalized distances between rankings
Sort
View
MOBIHOC
2005
ACM
15 years 11 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ADHOCNOW
2007
Springer
15 years 6 months ago
Topology Control and Geographic Routing in Realistic Wireless Networks
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pir...
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 6 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
CIKM
2007
Springer
15 years 6 months ago
Nugget discovery in visual exploration environments by query consolidation
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
ASSETS
2006
ACM
15 years 5 months ago
Interactive tracking of movable objects for the blind on the basis of environment models and perception-oriented object recognit
In previous work we have presented a prototype of an assistant system for the blind that can be used for self-localization and interactive object identification of static objects ...
Andreas Hub, Tim Hartter, Thomas Ertl