Sciweavers

5275 search results - page 475 / 1055
» Computing by observing
Sort
View
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 7 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
MCS
2008
Springer
15 years 7 months ago
Detecting multiple mean breaks at unknown points in official time series
In this paper, we propose a computationally effective approach to detect multiple structural breaks in the mean occurring at unknown dates. We present a non-parametric approach th...
Carmela Cappelli, Richard N. Penny, William S. Rea...
JSC
2006
95views more  JSC 2006»
15 years 7 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
MTA
2008
150views more  MTA 2008»
15 years 7 months ago
Evaluation and monitoring of video quality for UMA enabled video streaming systems
This paper1 deals with monitoring user perception of multimedia presentations in a Universal Multimedia Access (UMA) enabled system using objective no-reference (NR) metrics. Thes...
R. Venkatesh Babu, Andrew Perkis, Odd Inge Hillest...
185
Voted
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 7 months ago
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
Serge Gratton, Annick Sartenaer, Philippe L. Toint