4843 search results - page 340 / 969 » The Shortcut Problem - Complexity and Approximation |
162
click to vote
ICDAR
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
122
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
118
click to vote
ANOR
2006
15 years 4 months ago
2006
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
151
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...