849 search results - page 4 / 170 » On the Complexity of the Whitehead Minimization Problem |
FCT
2003
Springer
14 years 27 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
COR
2008
13 years 7 months ago
2008
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
WABI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Accurate denition of similarity measure is a key component
in image registration. Most commonly used intensitybased
similarity measures rely on the assumptions of independence
...