4903 search results - page 267 / 981 » The Set Covering Machine |
177
click to vote
FASE
2000
Springer
15 years 10 months ago
2000
Springer
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
156
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Inspired by longstanding lines of research in sociology and related fields, and by more recent largepopulation human subject experiments on the Internet and the Web, we initiate a...
153
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
227
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
This paper introduces a Bayesian method for clustering dynamic processes. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to disc...
201
click to vote
MLQ
2011
14 years 9 months ago
2011
We develop a new method for coding sets while preserving gch in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carr...