17018 search results - page 3186 / 3404 » From the How to the What |
146
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
171
click to vote
COCO
2009
Springer
16 years 1 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...
217
click to vote
COCO
2009
Springer
16 years 1 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...
184
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
This proposal explores the promotion of existing relational databases to Semantic Web Endpoints. It presents the benefits of ontologybased read and write access to existing relati...
179
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...