761 search results - page 49 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
In a print production system, the ability to match a printed document with its original electronic form enables services that improve robustness of the production process, such as...
UAI
2008
13 years 9 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
OPODIS
2004
13 years 9 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...