1421 search results - page 97 / 285 » Algorithms for subsequence combinatorics |
133
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
124
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
131
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
Fingerprint matching is one of the most important modules in automatic fingerprint identification systems (AFIS). Traditional methods treat this problem as point pattern matching,...
143
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
151
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...