Sciweavers

6358 search results - page 352 / 1272
» Computing spectral sequences
Sort
View
ICPR
2008
IEEE
16 years 8 months ago
A new HMM training and testing scheme
One of disadvantages of Hidden Markov Models (HMMs) is its low resistance to unexpected noises among observation sequences. Unexpected noises in a sequence usually "break&quo...
Albert Hung-Ren Ko, Alceu de Souza Britto Jr., Rob...
ICPR
2008
IEEE
16 years 8 months ago
Superresolution and blind deconvolution of video
In many real applications traditional superresolution methods fail to provide high-resolution images due to objectionable blur and inaccurate registration of input low-resolution ...
Filip Sroubek, Jan Flusser, Michal Sorel
ICPR
2006
IEEE
16 years 7 months ago
Affine Invariant Dynamic Time Warping and its Application to Online Rotated Handwriting Recognition
Dynamic Time Warping (DTW) has been widely used to align and compare two sequences. DTW can efficiently deal with local warp or deformation between sequences. However, it can'...
Yu Qiao, Makoto Yasuhara
ICPR
2006
IEEE
16 years 7 months ago
The Hidden Birth Dates of Personalities of Genesis
Witztum, Rips and Rosenberg [4] have shown that when the Book of Genesis is written as two-dimensional arrays with the topology of a cylinder, equidistant letter sequences spellin...
Doron Witztum
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
16 years 7 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold