Sciweavers

339 search results - page 40 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 11 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
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 ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
135
Voted
PPSN
2004
Springer
15 years 10 months ago
Hierarchical Genetic Algorithms
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...
Edwin D. de Jong, Dirk Thierens, Richard A. Watson
135
Voted
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
15 years 9 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...
EGPGV
2011
Springer
366views Visualization» more  EGPGV 2011»
14 years 8 months ago
GPU Algorithms for Diamond-based Multiresolution Terrain Processing
We present parallel algorithms for processing, extracting and rendering adaptively sampled regular terrain datasets represented as a multiresolution model defined by a super-squa...
M. Adil Yalçin, Kenneth Weiss, Leila De Flo...
PG
2007
IEEE
15 years 11 months ago
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
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 ...
Kartic Subr, James Arvo