Sciweavers

2638 search results - page 15 / 528
» Random Geometric Complexes
Sort
View
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
15 years 3 months ago
Towards Attack-Resilient Geometric Data Perturbation
Data perturbation is a popular technique for privacypreserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are no...
Keke Chen, Gordon Sun, Ling Liu
112
Voted
FSTTCS
2009
Springer
15 years 8 months ago
Kolmogorov Complexity in Randomness Extraction
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
87
Voted
SMI
2005
IEEE
15 years 7 months ago
Stochastic Microgeometry for Displacement Mapping
Creating surfaces with intricate small-scale features (microgeometry) and detail is an important task in geometric modeling and computer graphics. We present a model processing me...
Craig A. Schroeder, David E. Breen, Christopher D....
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
15 years 6 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
15 years 1 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg