2880 search results - page 11 / 576 » Approximate Range Searching |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
SIAMCOMP
2010
13 years 5 months ago
2010
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...