Sciweavers

114 search results - page 11 / 23
» An Offline Algorithm for Dimension-Bound Analysis
Sort
View
FOCM
2008
140views more  FOCM 2008»
13 years 7 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil
ICDAR
2003
IEEE
14 years 28 days ago
Optimizing the Number of States, Training Iterations and Gaussians in an HMM-based Handwritten Word Recognizer
In off-line handwriting recognition, classifiers based on hidden Markov models (HMMs) have become very popular. However, while there exist well-established training algorithms, s...
Simon Günter, Horst Bunke
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
13 years 11 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
13 years 9 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
ISMAR
2007
IEEE
14 years 1 months ago
A Method for Predicting Marker Tracking Error
Many Augmented Reality (AR) applications use marker-based vision tracking systems to recover camera pose by detecting one or more planar landmarks. However, most of these systems ...
Russell M. Freeman, Simon J. Juliet, Anthony Steed