Sciweavers

2638 search results - page 121 / 528
» Random Geometric Complexes
Sort
View
TSP
2010
14 years 11 months ago
A complex generalized Gaussian distribution: characterization, generation, and estimation
The generalized Gaussian distribution (GGD) provides a flexible and suitable tool for data modeling and simulation, however the characterization of the complex-valued GGD, in parti...
Mike Novey, Tülay Adali, Anindya Roy
SIGGRAPH
1999
ACM
15 years 9 months ago
Automatic Image Placement to Provide a Guaranteed Frame Rate
We present a preprocessing algorithm and run-time system for rendering 3D geometric models at a guaranteed frame rate. Our approach trades off space for frame rate by using images...
Daniel G. Aliaga, Anselmo Lastra
DCOSS
2006
Springer
15 years 8 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
JIDM
2010
122views more  JIDM 2010»
15 years 3 months ago
Revisiting "Privacy Preserving Clustering by Data Transformation"
Preserving the privacy of individuals when data are shared for clustering is a complex problem. The challenge is how to protect the underlying data values subjected to clustering w...
Stanley R. M. Oliveira, Osmar R. Zaïane
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 8 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch