1059 search results - page 185 / 212 » Improved Algorithms via Approximations of Probability Distri... |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
MOBIHOC
2010
ACM
13 years 6 months ago
2010
ACM
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We present an overview of FAB-MAP, an algorithm for place recognition and mapping developed for infrastructure-free mobile robot navigation in large environments. The system allow...