4536 search results - page 337 / 908 » Contention-Sensitive Data Structures and Algorithms |
176
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
For a finite set of points lying on a lower dimensional manifold embedded in a high-dimensional data space, algorithms have been developed to study the manifold structure. Howeve...
179
click to vote
LCTRTS
2007
Springer
16 years 28 days ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
189
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
230
click to vote
ALENEX
2008
15 years 8 months ago
2008
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
179
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...