Sciweavers

263 search results - page 20 / 53
» Regret Bounds for Prediction Problems
Sort
View
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 9 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 1 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 4 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
RTAS
2005
IEEE
14 years 3 months ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
14 years 4 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt