Sciweavers

11345 search results - page 2149 / 2269
» Foundations of Computer Science
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 6 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
DFG
2009
Springer
15 years 6 months ago
Interactive Communication, Diagnosis and Error Control in Networks
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Rudolf Ahlswede, Harout K. Aydinian
DFG
2009
Springer
15 years 6 months ago
Group-Level Analysis and Visualization of Social Networks
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
Michael Baur, Ulrik Brandes, Jürgen Lerner, D...
ERSHOV
2009
Springer
15 years 6 months ago
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
Florian Fischer, Gulay Ünel, Barry Bishop, Di...
FSTTCS
2009
Springer
15 years 6 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
« Prev « First page 2149 / 2269 Last » Next »