Sciweavers

287 search results - page 11 / 58
» UDS: A Universal Data Structure
Sort
View
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
14 years 22 days ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola
SPAA
1990
ACM
13 years 11 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
FAST
2009
13 years 5 months ago
Provenance as Data Mining: Combining File System Metadata with Content Analysis
Provenance describes how an object came to be in its present state. Thus, it describes the evolution of the object over time. Prior work on provenance has focussed on databases an...
Vinay Deolalikar, Hernan Laffitte
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
CORR
2008
Springer
157views Education» more  CORR 2008»
13 years 7 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko