Sciweavers

5595 search results - page 286 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICML
2005
IEEE
16 years 7 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 8 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 8 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
JCP
2007
143views more  JCP 2007»
15 years 6 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
DAC
2009
ACM
16 years 7 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...