656 search results - page 16 / 132 » Marrying Words and Trees |
143
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present Transitive Closure based visual word formation technique for obtaining robust object representations from smoothly varying multiple views. Each one of our visual words ...
156
click to vote
CPM
2001
Springer
15 years 10 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
171
click to vote
TCS
2010
15 years 18 days ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
163
click to vote
ICDM
2009
IEEE
16 years 17 days ago
2009
IEEE
: In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed Mean Output ...
176
click to vote
WADS
2007
Springer
16 years 7 hour ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...