2436 search results - page 80 / 488 » Comonadic Notions of Computation |
250
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
121
Voted
MM
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
147
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
147
Voted
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
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...
150
Voted
EUROCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...