1421 search results - page 112 / 285 » Algorithms for subsequence combinatorics |
148
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
137
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
142
click to vote
CPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
147
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
143
click to vote
ICIP
2008
IEEE
16 years 6 months ago
2008
IEEE
This paper proposes a data driven image segmentation algorithm, based on decomposing the target output (ground truth). Classical pixel labeling methods utilize machine learning al...