14518 search results - page 403 / 2904 » Two Problems for Sophistication |
183
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
188
click to vote
IPL
2008
15 years 6 months ago
2008
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
173
click to vote
COCOON
2005
Springer
16 years 11 days ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
189
click to vote
ICCSA
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
158
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper addresses the problem of mapping images between different vision sensors. Such a mapping could be modeled as a sampling problem that has to encompass the change of geom...