Sciweavers

339 search results - page 22 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
NLP
2000
15 years 1 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
ICIAR
2005
Springer
15 years 3 months ago
Robust Global Mosaic Topology Estimation for Real-Time Applications
This paper proposes an iterative methodology for real-time robust mosaic topology inference. It tackles the problem of optimal feature selection (optimal sampling) for global estim...
Nuno Pinho da Silva, João Paulo Costeira
63
Voted
WSC
2007
14 years 12 months ago
Rare-event simulation for a multidimensional random walk with t distributed increments
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
Jose H. Blanchet, Jingchen Liu
CVPR
2007
IEEE
15 years 11 months ago
Metropolis-Hasting techniques for finite-element-based registration
In this paper, we focus on the design of Markov Chain Monte Carlo techniques in a statistical registration framework based on finite element basis (FE). Due to the use of FE basis...
Adeline M. M. Samson, Frédéric J. P....
EUROPAR
2009
Springer
15 years 2 months ago
Detailed Performance Analysis Using Coarse Grain Sampling
Performance evaluation tools enable analysts to shed light on how applications behave both from a general point of view and at concrete execution points, but cannot provide detaile...
Harald Servat, Germán Llort, Judit Gimenez,...