2436 search results - page 428 / 488 » Comonadic Notions of Computation |
176
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
150
click to vote
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
130
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
128
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
157
Voted
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Resource discovery is an important process for finding suitable nodes that satisfy application requirements in large loosely-coupled distributed systems. Besides inter-node heter...