Sciweavers

5214 search results - page 171 / 1043
» The Online Specialization Problem
Sort
View
JMLR
2010
143views more  JMLR 2010»
15 years 2 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 6 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
CSE
2009
IEEE
15 years 10 months ago
All Friends Are Not Created Equal: An Interaction Intensity Based Approach to Privacy in Online Social Networks
Recent research identifies a growing privacy problem that exists within Online Social Networks (OSNs). Several studies have shown how easily strangers can extract personal data a...
Lerone Banks, Shyhtsun Felix Wu
GLVLSI
2010
IEEE
172views VLSI» more  GLVLSI 2010»
15 years 9 months ago
Online convex optimization-based algorithm for thermal management of MPSoCs
Meeting the temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. The goal of thermal mana...
Francesco Zanini, David Atienza, Giovanni De Miche...
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 5 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young