Sciweavers

63 search results - page 11 / 13
» Lower Bounds for Reducibility to the Kolmogorov Random Strin...
Sort
View
ECCC
2010
80views more  ECCC 2010»
13 years 7 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
COLT
2008
Springer
13 years 9 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
ICALP
2005
Springer
14 years 26 days ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 8 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CSE
2009
IEEE
14 years 2 months ago
Noise Injection for Search Privacy Protection
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
Shaozhi Ye, Shyhtsun Felix Wu, Raju Pandey, Hao Ch...