4541 search results - page 324 / 909 » Cache-Oblivious Algorithms and Data Structures |
134
click to vote
LCTRTS
2007
Springer
15 years 10 months 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. ...
135
click to vote
FOCS
2008
IEEE
15 years 10 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...
176
Voted
ALENEX
2008
15 years 5 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 ...
125
click to vote
CVPR
2007
IEEE
16 years 6 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 ...
156
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...