Sciweavers

1282 search results - page 146 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
TCBB
2008
103views more  TCBB 2008»
15 years 4 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
137
Voted
IPSN
2010
Springer
15 years 11 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
170
Voted
AIPRF
2008
15 years 6 months ago
Spam Sender Detection with Classification Modeling on Highly Imbalanced Mail Server Behavior Data
Unsolicited commercial or bulk emails or emails containing viruses pose a great threat to the utility of email communications. A recent solution for filtering is reputation systems...
Yuchun Tang, Sven Krasser, Dmitri Alperovitch, Pau...
162
Voted
CN
2006
145views more  CN 2006»
15 years 4 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
BMCBI
2010
161views more  BMCBI 2010»
15 years 2 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...