3341 search results - page 106 / 669 » On Bounded Queries and Approximation |
AAAI
2008
15 years 7 days ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
PVLDB
2010
14 years 8 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
MP
2006
14 years 10 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
SIAMJO
2008
14 years 9 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
148
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...