400 search results - page 57 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
104
Voted
CLUSTER
2001
IEEE
15 years 1 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
76
Voted
PODC
2004
ACM
15 years 2 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
92
Voted
RTCSA
2003
IEEE
15 years 2 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...