Sciweavers

3088 search results - page 346 / 618
» Online Passive-Aggressive Algorithms
Sort
View
SIAMJO
2008
175views more  SIAMJO 2008»
15 years 6 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
15 years 1 months ago
Learning in mean-field oscillator games
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday...
CVPR
2008
IEEE
16 years 8 months ago
Least squares surface reconstruction from measured gradient fields
This paper presents a new method for the reconstruction of a surface from its ? and ? gradient field, measured, for example, via Photometric Stereo. The new algorithm produces the...
Matthew Harker, Paul O'Leary
INFOCOM
2008
IEEE
16 years 1 months ago
Association Control in Mobile Wireless Networks
—As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. However, these handoffs can potentially incu...
Minkyong Kim, Zhen Liu, Srinivasan Parthasarathy 0...
COLT
2007
Springer
16 years 24 days ago
Regret to the Best vs. Regret to the Average
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...