Sciweavers

520 search results - page 5 / 104
» Subset Counting in Trees
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
ICCV
2009
IEEE
15 years 21 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
DCC
2004
IEEE
14 years 7 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 2 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
IWMM
2000
Springer
105views Hardware» more  IWMM 2000»
13 years 11 months ago
Diffusion Tree Restructuring for Indirect Reference Counting
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
Peter Dickman