5606 search results - page 746 / 1122 » Randomization Techniques for Graphs. |
173
click to vote
PODC
2005
ACM
16 years 11 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
198
click to vote
UIST
2005
ACM
16 years 11 days ago
2005
ACM
A significant problem encounteredwhen building Augmented Reality (AR) systems is that all spatial knowledge about the world has uncertainty associated with it. This uncertainty m...
224
click to vote
STACS
2005
Springer
16 years 9 days ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
147
click to vote
PRICAI
2004
Springer
16 years 5 days ago
2004
Springer
Search has arguably become the dominant paradigm for finding information on the World Wide Web. In order to build a successful search engine, there are a number of challenges that ...
172
click to vote
ICRA
2003
IEEE
16 years 3 days ago
2003
IEEE
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...