385 search results - page 60 / 77 » A Fast Algorithm for Matrix Balancing |
OOPSLA
1997
Springer
15 years 1 months ago
1997
Springer
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
FAST
2008
15 years 2 days ago
2008
The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices. Numerous erasure coding techniques have been develope...
126
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
121
click to vote
CP
2003
Springer
15 years 3 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
GPC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...