49 search results - page 6 / 10 » Approximate Counting by Sampling the Backtrack-free Search S... |
BMCBI
2010
13 years 7 months ago
2010
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
CPM
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
AMAI
2004
Springer
14 years 27 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
ECCV
2010
Springer
14 years 14 days ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...