Sciweavers

77 search results - page 8 / 16
» Extended Viterbi algorithm for optimized word HMMS
Sort
View
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
14 years 1 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
ISCAPDCS
2003
13 years 8 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
IVC
2007
142views more  IVC 2007»
13 years 7 months ago
Fast stochastic optimization for articulated structure tracking
Recently, an optimization approach for fast visual tracking of articulated structures based on Stochastic Meta-Descent (SMD) [7] has been presented. SMD is a gradient descent with...
Matthieu Bray, Esther Koller-Meier, Nicol N. Schra...
IS
2011
13 years 2 months ago
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
Pekka Kilpeläinen
SIAMJO
2000
76views more  SIAMJO 2000»
13 years 7 months ago
Superlinear Convergence and Implicit Filtering
In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the object...
T. D. Choi, C. T. Kelley