Sciweavers

1913 search results - page 148 / 383
» Group Input Machine
Sort
View
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 9 months ago
Improved Bounds for Finger Search on a RAM
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...
143
Voted
ICANN
2009
Springer
15 years 9 months ago
Empirical Study of the Universum SVM Learning for High-Dimensional Data
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...
Vladimir Cherkassky, Wuyang Dai
ICML
2000
IEEE
15 years 8 months ago
Discriminative Reranking for Natural Language Parsing
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...
Michael Collins
COLT
1994
Springer
15 years 8 months ago
Rigorous Learning Curve Bounds from Statistical Mechanics
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...
COLT
1992
Springer
15 years 8 months ago
Query by Committee
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...