Sciweavers

3874 search results - page 178 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ANTSW
2010
Springer
14 years 12 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
DAM
2007
177views more  DAM 2007»
15 years 1 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
ICML
2005
IEEE
16 years 2 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
WSCG
2000
117views more  WSCG 2000»
15 years 3 months ago
Solving Multiple Layer Containment Problems Using Iterative Methods
The footwear industry's need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, ...
Nuno Marques, Pedro Capela, João Bernardo
CVPR
1998
IEEE
16 years 4 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih