Sciweavers

598 search results - page 56 / 120
» Stably compact spaces
Sort
View
IWANN
2009
Springer
15 years 3 months ago
Lower Bounds for Approximation of Some Classes of Lebesgue Measurable Functions by Sigmoidal Neural Networks
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
José Luis Montaña, Cruz E. Borges
VVS
2000
IEEE
176views Visualization» more  VVS 2000»
15 years 3 months ago
4D volume rendering with the Shear Warp factorisation
A novel approach for rendering time-varying data based on the Shear-Warp factorisation is presented. Reduction in storage space is achieved by detecting the changed areas within e...
Kostas Anagnostou, Tim J. Atherton, Andrew E. Wate...
MFCS
1993
Springer
15 years 3 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 2 months ago
Using convex hulls to represent classifier conditions
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
Pier Luca Lanzi, Stewart W. Wilson
UAI
2008
15 years 17 days ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht