7150 search results - page 189 / 1430 » An Approximation Algorithm for Approximation Rank |
230
click to vote
APPROX
2000
Springer
15 years 10 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
183
click to vote
NIPS
1998
15 years 7 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
181
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Web pages, like people, are often known by others in a variety of contexts. When those contexts are sufficiently distinct, a page's importance may be better represented by mu...
184
click to vote
STOC
2003
ACM
16 years 6 months 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...
196
click to vote
DC
2008
15 years 6 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...