942 search results - page 115 / 189 » Distance Constraint Satisfaction Problems |
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
98
Voted
CVPR
2007
IEEE
16 years 6 days ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
89
Voted
ICML
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...