Sciweavers

1464 search results - page 56 / 293
» On optimal anonymization for l -diversity
Sort
View
IJRR
2007
104views more  IJRR 2007»
15 years 6 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
ICIP
1998
IEEE
16 years 7 months ago
Minimum Support Interpolators with Optimum Approximation Properties
Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...
Michael Unser, Philippe Thévenaz, Thierry B...
GLOBECOM
2007
IEEE
16 years 18 days ago
Volume Growth and General Rate Quantization on Grassmann Manifolds
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
Wei Dai, Brian Rider, Youjian Liu
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 6 months ago
Transforming data to satisfy privacy constraints
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
Vijay S. Iyengar
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 6 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah