Sciweavers

1493 search results - page 57 / 299
» Local resilience of graphs
Sort
View
92
Voted
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
15 years 6 months ago
Sparse appearance based modeling for robot localization
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
Olaf Booij, Zoran Zivkovic, Ben J. A. Kröse
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 4 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
108
Voted
SNPD
2007
15 years 2 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
120
Voted
FOCS
2008
IEEE
15 years 7 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
97
Voted
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 20 days ago
Removing Local Extrema from Imprecise Terrains
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
Chris Gray, Frank Kammer, Maarten Löffler, Ro...