14518 search results - page 2553 / 2904 » Two Problems for Sophistication |
235
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
184
click to vote
WEBDB
2009
Springer
16 years 1 months ago
2009
Springer
Recently, the opportunity of extracting structured data from the Web has been identified by a number of research projects. One such example is that millions of relational-style H...
153
click to vote
COCO
2009
Springer
16 years 1 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...
184
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
173
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...