11231 search results - page 448 / 2247 » Digging for Data Structures |
187
click to vote
JEA
2008
15 years 7 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
259
click to vote
SPIRE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
184
click to vote
PADL
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...
174
click to vote
TOOLS
1997
IEEE
15 years 11 months ago
1997
IEEE
We describe how to express homomorphic translations with an object-oriented design. This includes a uniform approach to the addition of external functionality to data structures. ...
173
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...