921 search results - page 86 / 185 » New Data Structures for Orthogonal Range Searching |
139
click to vote
IAJIT
2010
15 years 2 months ago
2010
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...
129
click to vote
ATVA
2009
Springer
15 years 11 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
136
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. ...
178
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
147
click to vote
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...