237 search results - page 22 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
CVIU
2011
13 years 2 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
COMPGEOM
1994
ACM
13 years 12 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...