4099 search results - page 420 / 820 » First Class Patterns |
179
click to vote
NIPS
2004
15 years 8 months ago
2004
We introduce a novel active-learning scenario in which a user wants to work with a learning algorithm to identify useful anomalies. These are distinguished from the traditional st...
176
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
157
click to vote
UAI
2001
15 years 8 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
166
click to vote
UAI
2004
15 years 8 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
165
click to vote
WSC
2001
15 years 8 months ago
2001
The purpose of this paper is to describe (a) why simulation is necessary to evaluate check-in, (b) a simulation toolbox for check-in counters and (c) Two case studies for Amsterda...