2566 search results - page 37 / 514 » The Online Median Problem |
79
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fa...
115
Voted
ESANN
2006
15 years 2 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
82
Voted
TALG
2010
14 years 11 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
134
click to vote
CCCG
2003
15 years 2 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
118
click to vote
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
Most recommendation methods (e.g., collaborative filtering) consist of (1) a computationally intense offline phase that computes a recommender model based on users’ opinions o...