6554 search results - page 1188 / 1311 » Constraint Logic Programming |
126
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
135
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
138
Voted
ICML
2008
IEEE
16 years 4 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...
144
Voted
CAV
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
123
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...