Sciweavers

141 search results - page 4 / 29
» Fast probabilistic snake algorithm
Sort
View
TNN
1998
89views more  TNN 1998»
14 years 9 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 3 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
ICARCV
2008
IEEE
170views Robotics» more  ICARCV 2008»
15 years 3 months ago
A fast Monte Carlo algorithm for collision probability estimation
—In order to navigate safely, it is important to detect and to react to a potentially dangerous situation. Such a situation can be underlined by a judicious use of the locations ...
Alain Lambert, Dominique Gruyer, Guillaume Saint-P...
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 1 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
CGF
2010
218views more  CGF 2010»
14 years 9 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...