Sciweavers

4541 search results - page 237 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
TIT
2010
107views Education» more  TIT 2010»
14 years 10 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
154
Voted
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
15 years 9 months ago
Adaptive Execution of Stream Window Joins in a Limited Memory Environment
A sliding window join (SWJoin) is becoming an integral operation in every stream data management system. In some streaming applications the increasing volume of streamed data as w...
Fatima Farag, Moustafa A. Hammad
107
Voted
SAC
2002
ACM
15 years 3 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
105
Voted
ISCAS
2003
IEEE
140views Hardware» more  ISCAS 2003»
15 years 8 months ago
On use of averaging in FxLMS algorithm for single-channel feedforward ANC systems
In this paper an active noise control (ANC) algorithm is proposed. This algorithm is based on adaptive filtering with averaging (AFA) and uses a similar structure as that of the F...
Muhammad Tahir Akhtar, Masahide Abe, Masayuki Kawa...
104
Voted
CATS
2008
15 years 5 months ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves