4541 search results - page 235 / 909 » Cache-Oblivious Algorithms and Data Structures |
141
Voted
KDD
2001
ACM
16 years 3 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
117
Voted
ESA
2003
Springer
15 years 8 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
117
Voted
CAV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
141
Voted
FPCA
1995
15 years 7 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
148
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...