Sciweavers

6045 search results - page 184 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
14 years 1 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
DEXA
2005
Springer
148views Database» more  DEXA 2005»
14 years 1 months ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
FOSSACS
2005
Springer
14 years 1 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
CVPR
2000
IEEE
14 years 10 months ago
A General Method for Errors-in-Variables Problems in Computer Vision
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
Bogdan Matei, Peter Meer