1421 search results - page 169 / 285 » Algorithms for subsequence combinatorics |
145
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
142
click to vote
CPM
2009
Springer
15 years 11 months ago
2009
Springer
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
133
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
239
click to vote
FOSSACS
2011
Springer
14 years 8 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
211
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Illumination conditions cause problems for many computer vision algorithms. Inparticular, shadows in an image can cause segmentation, tracking, or recognition algorithms to fail. I...