4541 search results - page 314 / 909 » Cache-Oblivious Algorithms and Data Structures |
175
click to vote
PODS
1999
ACM
15 years 8 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
153
click to vote
JCB
2006
15 years 4 months ago
2006
Genome-wide microarray designs containing millions to hundreds of millions of probes are available for a variety of mammals, including mouse and human. These genome tiling arrays ...
264
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
138
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
116
click to vote
TLDI
2003
ACM
15 years 9 months ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...