Sciweavers

19866 search results - page 341 / 3974
» Computing all factorizations in ***
Sort
View
EUROCRYPT
2000
Springer
15 years 10 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
HYBRID
1999
Springer
15 years 11 months ago
Orthogonal Polyhedra: Representation and Computation
Abstract. In this paper we investigate orthogonal polyhedra, i.e. polyhedra which are finite unions of full-dimensional hyper-rectangles. We define representation schemes for the...
Olivier Bournez, Oded Maler, Amir Pnueli
RULEML
2010
Springer
15 years 5 months ago
On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the a...
Ho-Pun Lam, Guido Governatori
GW
2009
Springer
255views Biometrics» more  GW 2009»
15 years 4 months ago
Gestures in Human-Computer Interaction - Just Another Modality?
The role of physical gestures in human-computer interaction has mostly been neglected. In this paper, we argue that gestures are not just one input modality. Rather, they should be...
Antti Pirhonen
IPPS
1998
IEEE
15 years 11 months ago
Emulating Direct Products by Index-Shuffle Graphs
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
Bojana Obrenic