Sciweavers

1728 search results - page 108 / 346
» The Accelerated Euclidean Algorithm
Sort
View
114
Voted
ECAL
2005
Springer
15 years 8 months ago
On the Mean Convergence Time of Multi-parent Genetic Algorithms Without Selection
This paper investigates genetic drift in multi-parent genetic algorithms (MPGAs). An exact model based on Markov chains is proposed to formulate the variation of gene frequency. Th...
Chuan-Kang Ting
FIMI
2004
134views Data Mining» more  FIMI 2004»
15 years 4 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt
NETWORKS
2008
15 years 2 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
125
Voted
WSCG
2003
145views more  WSCG 2003»
15 years 4 months ago
Real-Time Soft Shadows Using a Single Light Sample
We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
Florian Kirsch, Jürgen Döllner
144
Voted
COMPGEOM
2000
ACM
15 years 7 months ago
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
Greg Leibon, David Letscher