Sciweavers

2597 search results - page 454 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
SC
1995
ACM
15 years 9 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
CIKM
2008
Springer
15 years 8 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
DLT
2007
15 years 7 months ago
Two Element Unavoidable Sets of Partial Words
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
Francine Blanchet-Sadri, N. C. Brownstein, Justin ...
DBA
2006
236views Database» more  DBA 2006»
15 years 7 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
DICTA
2003
15 years 7 months ago
Extracting Boundaries from Images by Comparing Cooccurrence Matrices
Abstract. This paper describes methods of extracting region boundaries from the frames of an image sequence by combining information from spatial or temporal cooccurrence matrices ...
Astrit Rexhepi, Azriel Rosenfeld