Sciweavers

11231 search results - page 13 / 2247
» Digging for Data Structures
Sort
View
ICPR
2002
IEEE
14 years 8 months ago
Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
David B. Cooper, Andrew R. Willis, Stuart Andrews,...
COMPGEOM
2005
ACM
13 years 9 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
DATESO
2006
102views Database» more  DATESO 2006»
13 years 8 months ago
Transforming Data from DataPile Structure into RDF
Huge amount of interesting data has been gathered in the DataPile structure since its creation. This data could be used in the development of RDF databases. When limited to basic i...
Jirí Dokulil
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
14 years 5 days ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
EUROPAR
2003
Springer
14 years 17 days ago
Compression in Data Caches with Compressible Field Isolation for Recursive Data Structures
We introduce a software/hardware scheme called the Field Array Compression Technique (FACT) which reduces cache misses due to recursive data structures. Using a data layout transfo...
Masamichi Takagi, Kei Hiraki