Sciweavers

12194 search results - page 78 / 2439
» cans 2010
Sort
View
APPML
2010
112views more  APPML 2010»
13 years 9 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
CACM
2010
117views more  CACM 2010»
13 years 8 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry
CGF
2010
99views more  CGF 2010»
13 years 8 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder
CGF
2010
127views more  CGF 2010»
13 years 8 months ago
On Discrete Killing Vector Fields and Patterns on Surfaces
Symmetry is one of the most important properties of a shape, unifying form and function. It encodes semantic information on one hand, and affects the shape's aesthetic value ...
Mirela Ben-Chen, Adrian Butscher, Justin Solomon, ...
CJ
2010
128views more  CJ 2010»
13 years 8 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...