648 search results - page 15 / 130 » A general dimension for query learning |
ICASSP
2011
IEEE
13 years 14 days ago
2011
IEEE
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
COLT
1992
Springer
14 years 24 days ago
1992
Springer
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...
SDM
2003
SIAM
13 years 10 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...