727 search results - page 21 / 146 » Private approximation of search problems |
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
JIIS
2002
13 years 10 months ago
2002
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
ECML
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
ICDE
2009
IEEE
15 years 20 days ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
ANOR
2004
13 years 10 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...