1047 search results - page 89 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
233
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
186
click to vote
CVPR
2009
IEEE
17 years 24 days ago
2009
IEEE
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
161
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
163
click to vote
ECML
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
140
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...