Sciweavers

439 search results - page 28 / 88
» On the Information Rate of the Plenoptic Function
Sort
View
COLT
2010
Springer
14 years 10 months ago
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
John Duchi, Elad Hazan, Yoram Singer
99
Voted
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 7 months ago
Distributed subgradient methods and quantization effects
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozda...
109
Voted
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 4 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 22 days ago
Probing Capacity
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
ICIP
2007
IEEE
16 years 2 months ago
A Fully Scalable Motion Model for Scalable Video Coding
Motion information scalability is an important requirement for a fully scalable video codec, especially in low bit rate or small resolution decoding scenarios. So far, several lay...
Meng-Ping Kao, Truong Nguyen