2489 search results - page 354 / 498 » On the Subgroup Distance Problem |
191
click to vote
CIVR
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
158
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
135
click to vote
ATMOS
2007
15 years 5 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
129
click to vote
IJCAI
2007
15 years 5 months ago
2007
The training of support vector machines (SVM) involves a quadratic programming problem, which is often optimized by a complicated numerical solver. In this paper, we propose a muc...
111
click to vote
NIPS
2007
15 years 5 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...