We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
In this paper we introduce and investigate a mathematically rigorous theory of learning curves that is based on ideas from statistical mechanics. The advantage of our theory over ...
David Haussler, H. Sebastian Seung, Michael J. Kea...
We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal...
H. Sebastian Seung, Manfred Opper, Haim Sompolinsk...