Sciweavers

11213 search results - page 262 / 2243
» Low-contention data structures
Sort
View
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
15 years 11 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...
135
Voted
DATE
2004
IEEE
136views Hardware» more  DATE 2004»
15 years 9 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 10 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
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
15 years 5 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
147
Voted
CSDA
2008
94views more  CSDA 2008»
15 years 5 months ago
Feature significance for multivariate kernel density estimation
Multivariate kernel density estimation provides information about structure in data. Feature significance is a technique for deciding whether features
Tarn Duong, Arianna Cowling, Inge Koch, M. P. Wand