Sciweavers

1066 search results - page 55 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
CORR
2010
Springer
123views Education» more  CORR 2010»
14 years 9 months ago
Mutual Information of IID Complex Gaussian Signals on Block Rayleigh-faded Channels
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian input on a block Rayleigh-...
Fredrik Rusek, Angel Lozano, Nihar Jindal
FOCS
1992
IEEE
15 years 1 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 5 days ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
GCC
2007
Springer
15 years 3 months ago
Image Filtering on .NET-based Desktop Grids
Image filtering is the use of computer graphics algorithms to enhance the quality of digital images or to extract information about their content. However rendering very large siz...
Christian Vecchiola, Krishna Nadiminti, Rajkumar B...
JACM
2010
116views more  JACM 2010»
14 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára