Sciweavers

6365 search results - page 111 / 1273
» Fast Local Computation Algorithms
Sort
View
147
Voted
ANCS
2006
ACM
15 years 8 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
137
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 9 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
CSB
2003
IEEE
15 years 8 months ago
Fast and Accurate Probe Selection Algorithm for Large Genomes
The oligo microarray (DNA chip) technology in recent years has a significant impact on genomic study. Many fields such as gene discovery, drug discovery, toxicological research ...
Wing-Kin Sung, Wah-Heng Lee
150
Voted
BMCBI
2006
129views more  BMCBI 2006»
15 years 2 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 6 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale