Sciweavers

11784 search results - page 273 / 2357
» Interpolation for data structures
Sort
View
128
Voted
SSD
1995
Springer
84views Database» more  SSD 1995»
15 years 8 months ago
Lossless Representation of Topological Spatial Data
We present a data structure used to represent planar spatial databases in the topological data model. Conceptually, such databases consist of points, lines between these points, an...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche
ICDM
2003
IEEE
138views Data Mining» more  ICDM 2003»
15 years 10 months ago
PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
Daniel A. Keim, Christian Panse, Mike Sips, Stephe...
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
15 years 10 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
118
Voted
DATE
2004
IEEE
136views Hardware» more  DATE 2004»
15 years 8 months ago
Data Windows: A Data-Centric Approach for Query Execution in Memory-Resident Databases
Structured embedded databases are currently becoming an integrated part of embedded systems, thus, enabling higher standards in system automation. These embedded databases are typ...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
ICPR
2002
IEEE
15 years 9 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho