5964 search results - page 417 / 1193 » A theory of speculative computation |
181
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
206
click to vote
STOC
2002
ACM
16 years 8 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
249
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
203
click to vote
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip desi...
193
click to vote
ESOP
2009
Springer
16 years 2 months ago
2009
Springer
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...