Sciweavers

2090 search results - page 149 / 418
» Learning with attribute costs
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 9 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
CVPR
2010
IEEE
14 years 5 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
AUSAI
2004
Springer
14 years 2 months ago
Longer-Term Memory in Clause Weighting Local Search for SAT
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
Valnir Ferreira Jr., John Thornton
VLDB
1990
ACM
116views Database» more  VLDB 1990»
14 years 1 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
ECAI
2004
Springer
14 years 1 months ago
Avoiding Data Overfitting in Scientific Discovery: Experiments in Functional Genomics
Functional genomics is a typical scientific discovery domain characterized by a very large number of attributes (genes) relative to the number of examples (observations). The dang...
Dragan Gamberger, Nada Lavrac