807 search results - page 11 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
111
click to vote
GECCO
2007
Springer
2007
Springer
Exploring medical data using visual spaces with genetic programming and implicit functional mappings
15 years 5 months ago
Two medical data sets (Breast cancer and Colon cancer) are investigated within a visual data mining paradigm through the unsupervised construction of virtual reality spaces using ...
106
click to vote
ADBIS
2000
Springer
15 years 3 months ago
2000
Springer
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...