Sciweavers

1282 search results - page 34 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ESCIENCE
2006
IEEE
14 years 1 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
ISPDC
2005
IEEE
14 years 1 months ago
GMRES Method on Lightweight GRID System
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
Haiwu He, Guy Bergére, Serge G. Petiton
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 8 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
BIOINFORMATICS
2010
116views more  BIOINFORMATICS 2010»
13 years 7 months ago
A principal skeleton algorithm for standardizing confocal images of fruit fly nervous systems
Motivation: The fruit fly (Drosophila melanogaster) is a commonly used model organism in biology. We are currently building a 3D digital atlas of the fruit fly larval nervous syst...
Lei Qu, Hanchuan Peng
INFOCOM
1995
IEEE
13 years 11 months ago
Degree-Constrained Multicasting in Point-to-Point Networks
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
Fred Bauer, Anujan Varma