Sciweavers

1284 search results - page 102 / 257
» Data Structures for Mergeable Trees
Sort
View
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 9 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
DASFAA
2007
IEEE
135views Database» more  DASFAA 2007»
14 years 2 months ago
A Development of Hash-Lookup Trees to Support Querying Streaming XML
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
James Cheng, Wilfred Ng
AMAI
2005
Springer
13 years 7 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
ICDM
2006
IEEE
151views Data Mining» more  ICDM 2006»
14 years 1 months ago
Decision Trees for Functional Variables
Classification problems with functionally structured input variables arise naturally in many applications. In a clinical domain, for example, input variables could include a time...
Suhrid Balakrishnan, David Madigan
CIKM
2008
Springer
13 years 9 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...