Sciweavers

128 search results - page 26 / 26
» Hilbert's Twenty-Fourth Problem
Sort
View
MOC
2002
118views more  MOC 2002»
13 years 8 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
CSUR
2000
101views more  CSUR 2000»
13 years 8 months ago
Extracting usability information from user interface events
to extract information at a level of abstraction that is useful to investigators interested in analyzing application usage or evaluating usability. This survey examines computer-ai...
David M. Hilbert, David F. Redmiles
JMLR
2002
137views more  JMLR 2002»
13 years 8 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller