1059 search results - page 37 / 212 » Improved Algorithms via Approximations of Probability Distri... |
WWW
2005
ACM
16 years 15 days ago
2005
ACM
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
101
click to vote
STOC
2003
ACM
16 years 3 days ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
100
click to vote
SIAMCOMP
2008
14 years 11 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...