Sciweavers

112 search results - page 7 / 23
» Distributed anonymous discrete function computation
Sort
View
CTRSA
2004
Springer
89views Cryptology» more  CTRSA 2004»
14 years 4 days ago
Universal Re-encryption for Mixnets
We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits reencryption, such as ElGamal, does so only for a player w...
Philippe Golle, Markus Jakobsson, Ari Juels, Paul ...
CVPR
2004
IEEE
13 years 10 months ago
Diffeomorphic Matching of Distributions: A New Approach for Unlabelled Point-Sets and Sub-Manifolds Matching
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
Joan Glaunes, Alain Trouvé, Laurent Younes
TIT
2010
138views Education» more  TIT 2010»
13 years 1 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
APIN
1998
132views more  APIN 1998»
13 years 6 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon
COMPGEOM
2011
ACM
12 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...