Sciweavers

185 search results - page 21 / 37
» Discrete online TSP
Sort
View
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 8 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 9 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
JACM
2006
134views more  JACM 2006»
13 years 7 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
14 years 4 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu