Sciweavers

2254 search results - page 135 / 451
» Computing the minimal covering set
Sort
View
108
Voted
SIGGRAPH
2010
ACM
15 years 1 months ago
Photo zoom: high resolution from unordered image collections
We present a system to automatically construct high resolution images from an unordered set of low resolution photos. It consists of an automatic preprocessing step to establish c...
Martin Eisemann, Elmar Eisemann, Hans-Peter Seidel...
101
Voted
HCI
2009
14 years 10 months ago
Sign Language Recognition: Working with Limited Corpora
The availability of video format sign language corpora limited. This leads to a desire for techniques which do not rely on large, fully-labelled datasets. This paper covers various...
Helen Cooper, Richard Bowden
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 3 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 6 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
155
Voted
FOCS
2003
IEEE
15 years 6 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell