Sciweavers

72 search results - page 5 / 15
» Finite sample effects of the fast ICA algorithm
Sort
View
ANCS
2006
ACM
14 years 1 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
PAMI
2008
166views more  PAMI 2008»
13 years 7 months ago
Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing
This paper describes a method for robust real time pattern matching. We first introduce a family of image distance measures, the "Image Hamming Distance Family". Members ...
Ofir Pele, Michael Werman
IJRR
2010
185views more  IJRR 2010»
13 years 6 months ago
FISST-SLAM: Finite Set Statistical Approach to Simultaneous Localization and Mapping
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...
Bharath Kalyan, K. W. Lee, W. Sardha Wijesoma
TCOM
2008
75views more  TCOM 2008»
13 years 7 months ago
Fast performance estimation of block codes
Importance sampling is used in this paper to address the classical yet important problem of performance estimation of block codes. Simulation distributions that comprise discretean...
Rajan Srinivasan, Nuo Wang