780 search results - page 33 / 156 » Cost-Sharing Approximations for h |
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
FLAIRS
2007
13 years 9 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
NIPS
2004
13 years 8 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
JCO
2008
13 years 7 months ago
2008
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
DMTCS
2003
13 years 8 months ago
2003
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...