530 search results - page 69 / 106 » Universal randomized switching |
126
click to vote
ACL
2006
15 years 5 months ago
2006
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...
155
Voted
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
115
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
136
click to vote
DC
2008
15 years 4 months ago
2008
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
146
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...