Sciweavers

166 search results - page 22 / 34
» Towards a theory of cache-efficient algorithms
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 2 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
13 years 11 months ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter
ISVD
2010
IEEE
13 years 6 months ago
Guaranteed Quality Tetrahedral Delaunay Meshing for Medical Images
—In this paper, we present a Delaunay refinement algorithm for meshing 3D medical images. We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less tha...
Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos...
ICMLA
2010
13 years 5 months ago
A Probabilistic Graphical Model of Quantum Systems
Quantum systems are promising candidates of future computing and information processing devices. In a large system, information about the quantum states and processes may be incomp...
Chen-Hsiang Yeang
COMPGEOM
2004
ACM
14 years 1 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel