339 search results - page 40 / 68 » Random Sampling Techniques in Parallel Computation |
101
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
74
Voted
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
179
click to vote
EGPGV
2011
Springer
14 years 1 months ago
2011
Springer
We present parallel algorithms for processing, extracting and rendering adaptively sampled regular terrain datasets represented as a multiresolution model defined by a super-squa...
PG
2007
IEEE
2007
IEEE
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
15 years 3 months ago
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...