11212 search results - page 258 / 2243 » Semi-persistent Data Structures |
182
click to vote
GFKL
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
134
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...
208
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
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...
196
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
164
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...