Sciweavers

2354 search results - page 47 / 471
» Randomness, Stochasticity and Approximations
Sort
View
SAC
2005
ACM
14 years 1 months ago
Stochastic scheduling of active support vector learning algorithms
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...
Gaurav Pandey, Himanshu Gupta, Pabitra Mitra
COCOA
2008
Springer
13 years 9 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
ICML
2010
IEEE
13 years 8 months ago
Particle Filtered MCMC-MLE with Connections to Contrastive Divergence
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
SIAMCO
2008
113views more  SIAMCO 2008»
13 years 7 months ago
Singularly Perturbed Piecewise Deterministic Games
Abstract. In this paper we consider a class of hybrid stochastic games with the piecewise openloop information structure. These games are indexed over a parameter which represents...
Alain Haurie, Francesco Moresino
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman