Sciweavers

12194 search results - page 465 / 2439
» Numberings Optimal for Learning
Sort
View
JMLR
2011
137views more  JMLR 2011»
15 years 1 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
ECCV
2008
Springer
16 years 8 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
CVPR
2010
IEEE
15 years 10 months ago
Discriminative K-SVD for Dictionary Learning in Face Recognition
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
Qiang Zhang, Baoxin Li
CORR
2007
Springer
63views Education» more  CORR 2007»
15 years 6 months ago
Optimizing the SINR operating point of spatial networks
— This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and ...
Nihar Jindal, Jeffrey G. Andrews, Steven Weber
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
15 years 6 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg