Sciweavers

10146 search results - page 250 / 2030
» Fast FAST
Sort
View
CLEF
2010
Springer
14 years 11 months ago
FastDocode: Finding Approximated Segments of N-Grams for Document Copy Detection - Lab Report for PAN at CLEF 2010
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...
CVIU
2011
14 years 11 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
SIAMSC
2011
219views more  SIAMSC 2011»
14 years 11 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
TSP
2010
14 years 11 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
TSP
2010
14 years 11 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...