Sciweavers

2254 search results - page 55 / 451
» Computing the minimal covering set
Sort
View
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
12 years 12 days ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
ISSS
1996
IEEE
169views Hardware» more  ISSS 1996»
14 years 2 months ago
The Use of a Virtual Instruction Set for the Software Synthesis of HW/SW Embedded Systems
The application range of the embedded computing is going to cover the majority of the market products spanning from consumer electronic, automotive, telecom and process control. F...
Alessandro Balboni, William Fornaciari, M. Vincenz...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
GBRPR
2007
Springer
14 years 1 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion
SPDP
1991
IEEE
14 years 1 months ago
Fault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho