2593 search results - page 276 / 519 » Algorithms and Data Structures for Computer Topology |
201
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
195
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
219
click to vote
NN
2002
Springer
15 years 6 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
216
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
214
click to vote
EWSN
2010
Springer
16 years 8 days ago
2010
Springer
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...