Sciweavers

274 search results - page 7 / 55
» Improving vulnerability discovery models
Sort
View
TSP
2008
91views more  TSP 2008»
13 years 7 months ago
A Sequential Monte Carlo Method for Motif Discovery
We propose a sequential Monte Carlo (SMC)-based motif discovery algorithm that can efficiently detect motifs in datasets containing a large number of sequences. The statistical di...
Kuo-ching Liang, Xiaodong Wang, Dimitris Anastassi...
SAC
2004
ACM
14 years 1 months ago
Guiding motif discovery by iterative pattern refinement
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
Zhiping Wang, Mehmet M. Dalkilic, Sun Kim
BMCBI
2006
113views more  BMCBI 2006»
13 years 7 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
CCS
2008
ACM
13 years 9 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
ACL
2003
13 years 9 months ago
An Improved Extraction Pattern Representation Model for Automatic IE Pattern Acquisition
Several approaches have been described for the automatic unsupervised acquisition of patterns for information extraction. Each approach is based on a particular model for the patt...
Kiyoshi Sudo, Satoshi Sekine, Ralph Grishman