4377 search results - page 740 / 876 » Mass problems and randomness |
159
Voted
NIPS
2003
15 years 7 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
187
click to vote
UAI
2003
15 years 7 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
154
Voted
NIPS
1998
1998
Probabilistic Modeling for Face Orientation Discrimination: Learning from Labeled and Unlabeled Data
15 years 7 months ago
This paper presents probabilistic modeling methods to solve the problem of discriminating between five facial orientations with very little labeled data. Three models are explored...
169
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
143
click to vote
WSC
1998
15 years 7 months ago
1998
An important problem in discrete-event stochastic simulation is the selection of the best system from a finite set of alternatives. There are many techniques for ranking and selec...