Sciweavers

1414 search results - page 132 / 283
» Randomness and Universal Machines
Sort
View
ML
2010
ACM
163views Machine Learning» more  ML 2010»
14 years 7 months ago
Classification with guaranteed probability of error
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
Marco C. Campi
202
Voted
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 1 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
129
Voted
AI
2008
Springer
15 years 24 days ago
The well-designed child
This article is inspired by recent psychological studies confirming that a child is not born a blank slate but has important innate capabilities. An important part of the "le...
John McCarthy
ICALP
2007
Springer
15 years 6 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
SPAA
2005
ACM
15 years 6 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner