Sciweavers

181 search results - page 4 / 37
» Online promise problems with online width metrics
Sort
View
NIPS
2008
13 years 9 months ago
Online Metric Learning and Fast Similarity Search
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kr...
ECCC
2007
180views more  ECCC 2007»
13 years 7 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
ICML
2010
IEEE
13 years 5 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
14 years 2 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...