Sciweavers

11016 search results - page 2059 / 2204
» Cloud Computing for Science
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 11 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 11 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 11 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 11 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 11 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...
« Prev « First page 2059 / 2204 Last » Next »