Sciweavers

339 search results - page 30 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
AAAI
2010
14 years 11 months ago
g-Planner: Real-time Motion Planning and Global Navigation using GPUs
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
Jia Pan, Christian Lauterbach, Dinesh Manocha
CF
2007
ACM
15 years 1 months ago
Identifying potential parallelism via loop-centric profiling
The transition to multithreaded, multi-core designs places a greater responsibility on programmers and software for improving performance; thread-level parallelism (TLP) will be i...
Tipp Moseley, Daniel A. Connors, Dirk Grunwald, Ra...
PODC
2010
ACM
15 years 1 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
SASN
2006
ACM
15 years 3 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
82
Voted
TIP
2010
137views more  TIP 2010»
14 years 4 months ago
Adaptive Langevin Sampler for Separation of t-Distribution Modelled Astrophysical Maps
We propose to model the image differentials of astrophysical source maps by Student's t-distribution and to use them in the Bayesian source separation method as priors. We int...
Koray Kayabol, Ercan E. Kuruoglu, José Luis...