Sciweavers

2498 search results - page 50 / 500
» Data Structures with Unpredictable Timing
Sort
View
JMLR
2008
148views more  JMLR 2008»
14 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 3 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
STACS
2010
Springer
15 years 4 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
CN
2008
110views more  CN 2008»
14 years 9 months ago
The eternal sunshine of the sketch data structure
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
Xenofontas A. Dimitropoulos, Marc Ph. Stoecklin, P...
IPMI
2007
Springer
15 years 10 months ago
Adaptive Time-Frequency Models for Single-Trial M/EEG Analysis
Abstract. A new method is introduced for estimating single-trial magnetoor electro-encephalography (M/EEG), based on a non-linear fit of timefrequency atoms. The method can be appl...
Christian Bénar, Maureen Clerc, Théo...