4860 search results - page 242 / 972 » SNPs Problems, Complexity, and Algorithms |
STOC
2010
ACM
14 years 3 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
ICDAR
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....
CIE
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
ECAI
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
CCECE
2011
IEEE
12 years 10 months ago
2011
IEEE
— Although "Adaptive Mesh" is regarded as complicating method for object tracking accompanied with many controversies and obstacles, but it has been proposed that such ...