Sciweavers

19866 search results - page 325 / 3974
» Computing all factorizations in ***
Sort
View
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
15 years 11 months ago
A computable type theory for control systems
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
Pieter Collins
CTRSA
2008
Springer
197views Cryptology» more  CTRSA 2008»
15 years 8 months ago
Legally-Enforceable Fairness in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
Andrew Y. Lindell
CCCG
2007
15 years 8 months ago
Computing Acute and Non-obtuse Triangulations
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
Hale Erten, Alper Üngör
SIGCSE
2008
ACM
150views Education» more  SIGCSE 2008»
15 years 6 months ago
Computing education for sustainability
Computing plays a critical role in sustainability. This paper examines the status of education for sustainability in computing. There are clearly stated high level declarations fo...
Samuel Mann, Lesley Smith, Logan Muller
PODC
1999
ACM
15 years 11 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna