7006 search results - page 499 / 1402 » Approximation Algorithms |
167
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
171
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
166
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
385
click to vote
ICASSP
2011
IEEE
15 years 3 months ago
2011
IEEE
The scope of the well-known k-means algorithm has been
broadly extended with some recent results: first, the k-
means++ initialization method gives some approximation
guarantees...
156
click to vote
ACCV
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...