Sciweavers

252 search results - page 22 / 51
» Efficient Algorithms for Minimizing Cross Validation Error
Sort
View
147
Voted
JMLR
2010
147views more  JMLR 2010»
14 years 10 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
NIPS
2000
15 years 5 months ago
Feature Selection for SVMs
We introduce a method of feature selection for Support Vector Machines. The method is based upon finding those features which minimize bounds on the leave-one-out error. This sear...
Jason Weston, Sayan Mukherjee, Olivier Chapelle, M...
145
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Efficient iterative receiver for bit-Interleaved Coded Modulation according to the DVB-T2 standard
Bit-Interleaved Coded Modulation (BICM) offers a significant improvement in error correcting performance for coded modulations over fading channels compared to the previously exis...
Meng Li, Charbel Abdel Nour, Christophe Jég...
136
Voted
COOPIS
2002
IEEE
15 years 8 months ago
Efficient Querying of Distributed Resources in Mediator Systems
: This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making ...
Ioana Manolescu, Luc Bouganim, Françoise Fa...
156
Voted
TOG
2008
163views more  TOG 2008»
15 years 3 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...