Sciweavers

2038 search results - page 271 / 408
» Loops under Strategies
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
ICML
2004
IEEE
16 years 5 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
ISBI
2006
IEEE
16 years 5 months ago
Closed and open source neuroimage analysis tools and libraries at UNC
The emergence of open-source libraries and development tools in the last decade has changed the process of academic software development in many ways. In medical image processing ...
Martin Andreas Styner, Matthieu Jomier, Guido Geri...
WWW
2009
ACM
16 years 5 months ago
Towards context-aware search by learning a very large variable length hidden markov model from search logs
Capturing the context of a user's query from the previous queries and clicks in the same session may help understand the user's information need. A context-aware approac...
Huanhuan Cao, Daxin Jiang, Jian Pei, Enhong Chen, ...
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 5 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...