Sciweavers

674 search results - page 40 / 135
» From Constructibility and Absoluteness to Computability and ...
Sort
View
FOCS
2007
IEEE
15 years 8 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
ACS
2011
14 years 9 months ago
Epicompletion in Frames with Skeletal Maps, III: When Maps are Closed
In previous work it was shown that there is an epireflection ψ of the category of all compact normal, joinfit frames, with skeletal maps, in the full subcategory of frames which...
Jorge Martínez
KCAP
2003
ACM
15 years 7 months ago
A generic library of problem solving methods for scheduling applications
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
ICS
2010
Tsinghua U.
15 years 11 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
ICPR
2006
IEEE
16 years 3 months ago
Epipolar Geometry from Two Correspondences
A novel algorithm for robust RANSAC-like estimation of epipolar geometry (of uncalibrated camera pair) from two correspondences of local affine frames (LAFs) is presented. Each LA...
Michal Perdoch, Jiri Matas, Ondrej Chum