Sciweavers

6943 search results - page 973 / 1389
» Representations for evolutionary algorithms
Sort
View
CGF
2008
227views more  CGF 2008»
15 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
CG
2007
Springer
15 years 6 months ago
Visualizing and animating the winged-edge data structure
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
PRL
2006
139views more  PRL 2006»
15 years 6 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
185
Voted
TASLP
2008
136views more  TASLP 2008»
15 years 6 months ago
Distortion Estimation in Compressed Music Using Only Audio Fingerprints
Abstract--An audio fingerprint is a compact yet very robust representation of the perceptually relevant parts of an audio signal. It can be used for content-based audio identificat...
Peter Jan O. Doets, Reginald L. Lagendijk
256
Voted
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 6 months ago
Detecting Race Conditions in Parallel Programs that Use Semaphores
Abstract. We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race co...
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer