559 search results - page 78 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
AAAI
2004
13 years 10 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
SIAMIS
2011
13 years 3 months ago
2011
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
ECAI
2006
Springer
14 years 13 days ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
EVOW
2010
Springer
14 years 24 days ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...