42230 search results - page 326 / 8446 » Algorithms and Complexity Results for |
188
Voted
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
213
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however...
194
click to vote
JCC
2006
15 years 6 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
151
click to vote
SMI
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
178
click to vote
SOFSEM
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...