Sciweavers

2436 search results - page 428 / 488
» Comonadic Notions of Computation
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—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...
Ronen Shaltiel
TLCA
2009
Springer
14 years 4 months ago
A Logical Foundation for Environment Classifiers
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...
Takeshi Tsukada, Atsushi Igarashi
COMPGEOM
2009
ACM
14 years 4 months ago
Proximity of persistence modules and their diagrams
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...
Frédéric Chazal, David Cohen-Steiner...
FOCS
2008
IEEE
14 years 4 months ago
Mixing Time of Exponential Random Graphs
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...
Shankar Bhamidi, Guy Bresler, Allan Sly
ICDCS
2008
IEEE
14 years 4 months ago
Resource Bundles: Using Aggregation for Statistical Wide-Area Resource Discovery and Allocation
Resource discovery is an important process for finding suitable nodes that satisfy application requirements in large loosely-coupled distributed systems. Besides inter-node heter...
Michael Cardosa, Abhishek Chandra