1096 search results - page 139 / 220 » Computation Slicing: Techniques and Theory |
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Prominent feature point descriptors such as SIFT and
SURF allow reliable real-time matching but at a compu-
tational cost that limits the number of points that can be
handled on...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
Statistical modeling for content based retrieval is examined in the context of recent TREC Video benchmark exercise. The TREC Video exercise can be viewed as a test bed for evalua...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representa...