Sciweavers

17760 search results - page 176 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
SCL
2008
82views more  SCL 2008»
15 years 4 months ago
An efficient algorithm for positive realizations
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...
Wojciech Czaja, Philippe Jaming, Máté...
ICML
2010
IEEE
15 years 5 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
COLT
1998
Springer
15 years 8 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
118
Voted
GECCO
2003
Springer
122views Optimization» more  GECCO 2003»
15 years 9 months ago
The Virtual Gene Genetic Algorithm
This paper presents the virtual gene genetic algorithm (vgGA) which is a generalization of traditional genetic algorithms that use binary linear chromosomes. In the vgGA, tradition...
Manuel Valenzuela-Rendón
FOCS
2006
IEEE
15 years 10 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko