2103 search results - page 198 / 421 » Approximate Learning of Dynamic Models |
141
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
189
click to vote
ICMLC
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a novel approach for adaptive online multi-stroke sketch recognition based on Hidden Markov Model (HMM). The method views the drawing sketch as the result of a ...
141
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at ...
151
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
155
click to vote
QEST
2009
IEEE
16 years 1 months ago
2009
IEEE
—Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim ...