1421 search results - page 132 / 285 » Algorithms for subsequence combinatorics |
155
click to vote
TCS
2008
15 years 4 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
150
click to vote
SIAMDM
1998
15 years 4 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
162
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
133
click to vote
ICIP
2004
IEEE
16 years 6 months ago
2004
IEEE
Many different types of silicon fingerprint sweep sensors presently enter the biometrics market. Since they provide small stripe image sequences instead of full fingerprint images...
139
Voted
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
2D projection imaging is a widely used procedure for vessel visualization. For the subsequent analysis of the vasculature, precise measurements of e.g. vessel area, vessel length ...