10304 search results - page 1919 / 2061 » Computer science with the sciences: an emphasis in computati... |
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
116
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
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...
149
Voted
COCO
2009
Springer
15 years 8 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...
121
Voted
DFG
2009
Springer
15 years 8 months ago
2009
Springer
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...
116
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Mathematical modeling for gene regulative networks (GRNs) provides an effective tool for hypothesis testing in biology. A necessary step in setting up such models is the estimati...