814 search results - page 139 / 163 » Optimal pairings |
CC
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
BMCBI
2010
13 years 10 months ago
2010
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— We consider a dense fading multi-user network with multiple active multi-antenna source-destination pair terminals communicating simultaneously through a large common set of K ...
BMCBI
2004
13 years 9 months ago
2004
Background: Computer programs for the generation of multiple sequence alignments such as "Clustal W" allow detection of regions that are most conserved among many sequen...