Search Results

An early paper that made this observation explicitly -- that rotations preserve inorder traversals -- is (in Figure 2 of) Sleator and Tarjan's 1983 Self-adjusting binary search trees. The move-to-roo …

I think the reference you are looking for is the paper "Broadcasting algorithms in radio networks with unknown topology" by Czumaj and Rytter. It seems this paper makes some improvements, but I think …

Yes - Satyen Kale, Rob Schapire, and I have a recent paper (NIPS '10) on this very problem, where we consider choosing "slates" of arms instead of individual arms. We consider the cases when position …

If no class is too simple, then here are some agnostically PAC learnable classes. In response to the comments, the classes with polynomially many hypotheses are crossed out: constant depth decision …

This is a great question, one I've put a lot of thought into. In an internet ad auction, you want a pricing policy that encourages truthful revelation. You could run a normal second price auction on …

Lamport's Part Time Parliament made a breakthrough in distributed computing, but the paper was so (purposely!) obfuscated that people couldn't understand it -- as far as I know, it took him around 10 …

I'm not sure this is the best book to prepare for exams, but the book Finite Automata; Behavior and Synthesis by B. A. Trakhtenbrot and Ya. M. Barzdinʹ is quite good. It has a surprising number …

Yes - I think you are looking for "multiclass VC dimension," and there are a couple different generalizations of VC dimension to multiclass classification. A good paper on this is by Ben-David et al. …

Both can be done efficiently. You can compute the connectivity of a graph by testing the connectivity of every pair using max-flow/min-cut and taking the smallest of the values gives you $k$ (see thi …

I don't know if you'll consider the following a non-trivial bound, but here I go. First, to be clear so that we're not confusing $c$-DNF with $k$-term DNF (which I often do), an $c$-DNF formula over …

Another good introductory book is "Foundations of Machine Learning" by Mohri et al.: https://www.amazon.com/Foundations-Machine-Learning-Mehryar-Mohri/dp/0262039400/. It has a large overlap with the …

The closest things I'm aware of in the literature are extensions of Chernoff bounds to negatively correlated random variables, e.g. see this or this. Formally, your condition could be satisfied witho …

Sure, there are lots of examples, at least in the spirit of your question. Often one gets such a result from the probabilistic method. For example, one paper that I like that runs into the problem is …

We've just put up a paper on arXiv (http://arxiv.org/abs/1201.1214) that proves generic lower bounds for "statistical algorithms" for optimization problems, with each "problem" having its own lower bo …

There is a nice tutorial from ICML 2008 by Yoram Singer and Shai Shalev Shwartz on the theory and practice of online learning.