Sciweavers

107 search results - page 9 / 22
» General Loss Bounds for Universal Sequence Prediction
Sort
View
TIT
2002
164views more  TIT 2002»
13 years 7 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
VR
2010
IEEE
154views Virtual Reality» more  VR 2010»
13 years 5 months ago
On error bound estimation for motion prediction
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...
Rynson W. H. Lau, Kenneth Lee
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 1 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
ICPR
2002
IEEE
14 years 9 days ago
Motion Prediction Using VC-Generalization Bounds
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Ch...
ALT
2003
Springer
14 years 4 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter