Sciweavers

1477 search results - page 251 / 296
» Random Convex Programs
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
CCS
2005
ACM
14 years 1 months ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
13 years 11 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
WSC
2000
13 years 9 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
ALMOB
2008
85views more  ALMOB 2008»
13 years 7 months ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...