Sciweavers

30 search results - page 4 / 6
» Solutions diversification in a column generation algorithm
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ORL
1998
116views more  ORL 1998»
13 years 7 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
DAC
1994
ACM
13 years 12 months ago
A Fully Implicit Algorithm for Exact State Minimization
State minimization of incompletely specifiedmachinesis an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate ...
Timothy Kam, Tiziano Villa, Robert K. Brayton, Alb...
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 8 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
14 years 1 months ago
Semi-Supervised Mixture of Kernels via LPBoost Methods
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
Jinbo Bi, Glenn Fung, Murat Dundar, R. Bharat Rao