Sciweavers

3122 search results - page 140 / 625
» Storing Semistructured Data with STORED
Sort
View
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
MLDM
2007
Springer
14 years 4 months ago
Transductive Learning from Relational Data
Transduction is an inference mechanism “from particular to particular”. Its application to classification tasks implies the use of both labeled (training) data and unlabeled (...
Michelangelo Ceci, Annalisa Appice, Nicola Barile,...
NAR
2011
248views Computer Vision» more  NAR 2011»
13 years 28 days ago
NCBI GEO: archive for functional genomics data sets - 10 years on
A decade ago, the Gene Expression Omnibus (GEO) database was established at the National Center for Biotechnology Information (NCBI). The original objective of GEO was to serve as...
Tanya Barrett, Dennis B. Troup, Stephen E. Wilhite...
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
13 years 27 days ago
Warding off the dangers of data corruption with amulet
Occasional corruption of stored data is an unfortunate byproduct of the complexity of modern systems. Hardware errors, software bugs, and mistakes by human administrators can corr...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
STACS
2010
Springer
14 years 5 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf