250 search results - page 25 / 50 » Fixed Argument Pairings |
COMBINATORICS
2004
13 years 9 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
TSP
2010
13 years 4 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
The increasing availability and deployment of open source software in personal and commercial environments makes open source software highly appealing for hackers, and others who ...