Sciweavers

6365 search results - page 64 / 1273
» Fast Local Computation Algorithms
Sort
View
97
Voted
ICMCS
2006
IEEE
310views Multimedia» more  ICMCS 2006»
15 years 6 months ago
An Optimal and Statistically Robust Correlation Technique for Block Based Motion Estimation
In this paper we propose an optimal and robust correlation technique for the local motion estimation purposes. It is based on the maximization of a statistical robust matching fun...
Fedwa Essannouni, Rachid Oulad Haj Thami, Ahmed Sa...
ALMOB
2006
80views more  ALMOB 2006»
15 years 20 days ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
DRR
2008
15 years 2 months ago
Efficient implementation of local adaptive thresholding techniques using integral images
Adaptive binarization is an important first step in many document analysis and OCR processes. This paper describes a fast adaptive binarization algorithm that yields the same qual...
Faisal Shafait, Daniel Keysers, Thomas M. Breuel
142
Voted
BMCBI
2007
226views more  BMCBI 2007»
15 years 21 days ago
MiRFinder: an improved approach and software implementation for genome-wide fast microRNA precursor scans
Background: MicroRNAs (miRNAs) are recognized as one of the most important families of noncoding RNAs that serve as important sequence-specific post-transcriptional regulators of ...
Ting-Hua Huang, Bin Fan, Max F. Rothschild, Zhi-Li...
72
Voted
RTSS
2007
IEEE
15 years 6 months ago
Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines
Marek Chrobak, Mathilde Hurand, Jiri Sgall