Sciweavers

1516 search results - page 161 / 304
» On the Learnability of Vector Spaces
Sort
View
CEC
2008
IEEE
14 years 11 months ago
A technique for the visualization of population-based algorithms
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...
Konstantinos E. Parsopoulos, Voula C. Georgopoulos...
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 10 months ago
A finiteness structure on resource terms
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
Thomas Ehrhard
CORR
2007
Springer
138views Education» more  CORR 2007»
14 years 10 months ago
Low Density Lattice Codes
— Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC...
Naftali Sommer, Meir Feder, Ofir Shalvi
JMLR
2006
143views more  JMLR 2006»
14 years 10 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
TIT
2002
72views more  TIT 2002»
14 years 9 months ago
Optimal tight frames and quantum measurement
Tight frames and rank-one quantum measurements are shown to be intimately related. In fact, the family of normalized tight frames for the space in which a quantum-mechanical system...
Yonina C. Eldar, G. David Forney Jr.