Sciweavers

597 search results - page 8 / 120
» Dominating Distributions and Learnability
Sort
View
AMCS
2010
121views Mathematics» more  AMCS 2010»
13 years 9 months ago
Weak and exact domination in distributed systems
Larbi Afifi, El Mostafa Magri, Abdelhaq El Jai
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
FOCS
1990
IEEE
14 years 2 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
TSD
2004
Springer
14 years 4 months ago
How Dominant Is the Commonest Sense of a Word?
We present a mathematical model of word sense frequency distributions, and use word distributions to set parameters. The model implies that the expected dominance of the commonest ...
Adam Kilgarriff
COLT
2001
Springer
14 years 3 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman