4541 search results - page 25 / 909 » Cache-Oblivious Algorithms and Data Structures |
116
Voted
ESA
2004
Springer
15 years 4 months ago
2004
Springer
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
82
Voted
ICCNMC
2005
Springer
15 years 6 months ago
2005
Springer
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
69
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
112
click to vote
DATESO
2009
14 years 10 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
159
click to vote
ESA
2011
Springer
14 years 17 days ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...