Results 1  10
of
1,035,997
Computing arbitrary functions of encrypted data
 Commun. ACM
, 2010
"... 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 homomorphic” encryption scheme that keeps data private, but that allows a worker that does not have the secret decryption key to comput ..."
Abstract

Cited by 85 (0 self)
 Add to MetaCart
to compute any (still encrypted) result of the data, even when the function of the data is very complex. In short, a third party can perform complicated processing of data without being able to see it. Among other things, this helps make cloud computing compatible with privacy. 1.
On the TwoCenter Expansion of an Arbitrary Function
, 1970
"... A systematic method of derivation, based on the algebra of irreducible tensors, is given of the twocenter expansion of an arbitrary function of the distance. A direct application of the method is made to the case of Rn, n being a positive or negative integer. The obtained result has such an element ..."
Abstract
 Add to MetaCart
A systematic method of derivation, based on the algebra of irreducible tensors, is given of the twocenter expansion of an arbitrary function of the distance. A direct application of the method is made to the case of Rn, n being a positive or negative integer. The obtained result has
Multiresolution Analysis for Surfaces Of Arbitrary . . .
, 1993
"... Multiresolution analysis provides a useful and efficient tool for representing shape and analyzing features at multiple levels of detail. Although the technique has met with considerable success when applied to univariate functions, images, and more generally to functions defined on lR , to our k ..."
Abstract

Cited by 389 (3 self)
 Add to MetaCart
knowledge it has not been extended to functions defined on surfaces of arbitrary genus. In this
Approximation by Superpositions of a Sigmoidal Function
, 1989
"... In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set ofaffine functionals can uniformly approximate any continuous function of n real variables with support in the unit hypercube; only mild conditions are imposed on the univariate fun ..."
Abstract

Cited by 1246 (2 self)
 Add to MetaCart
function. Our results settle an open question about representability in the class of single bidden layer neural networks. In particular, we show that arbitrary decision regions can be arbitrarily well approximated by continuous feedforward neural networks with only a single internal, hidden layer and any
Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1184 (60 self)
 Add to MetaCart
We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion
PÓLYA–TYPE INEQUALITIES FOR ARBITRARY FUNCTIONS
"... Abstract. Generalizations of the Pólya inequality are given involving real and operator functions which satisfy certain subordination and end–point conditions but are otherwise arbitrary. Applications are made to generalized quasiarithmetic means and symmetric means. 1. ..."
Abstract
 Add to MetaCart
Abstract. Generalizations of the Pólya inequality are given involving real and operator functions which satisfy certain subordination and end–point conditions but are otherwise arbitrary. Applications are made to generalized quasiarithmetic means and symmetric means. 1.
THE CLOSEDFORM INTEGRATION OF ARBITRARY FUNCTIONS
"... Consider the common experience of a student who progresses far enough in school mathematics to begin to study the calculus. After motivation of the topic of `rates of change', simple dierentiation is learned. More advanced functions are then considered, and eventually the student meets the pr ..."
Abstract
 Add to MetaCart
Consider the common experience of a student who progresses far enough in school mathematics to begin to study the calculus. After motivation of the topic of `rates of change', simple dierentiation is learned. More advanced functions are then considered, and eventually the student meets
Fast approximate energy minimization via graph cuts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract

Cited by 2121 (61 self)
 Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when
The Design and Use of Steerable Filters
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1991
"... Oriented filters are useful in many early vision and image processing tasks. One often needs to apply the same filter, rotated to different angles under adaptive control, or wishes to calculate the filter response at various orientations. We present an efficient architecture to synthesize filters of ..."
Abstract

Cited by 1091 (11 self)
 Add to MetaCart
of arbitrary orientations from linear combinations of basis filters, allowing one to adaptively "steer" a filter to any orientation, and to determine analytically the filter output as a function of orientation.
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 521 (18 self)
 Add to MetaCart
to an arbitrary monad, and how the resulting programming feature can concisely express in a pure functional language some programs that manipulate state, handle exceptions, parse text, or invoke continuations. A new solution to the old problem of destructive array update is also presented. No knowledge
Results 1  10
of
1,035,997