Sciweavers

23590 search results - page 102 / 4718
» Algorithm Performance Contest
Sort
View
PODC
2003
ACM
14 years 2 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 3 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
DATE
2003
IEEE
63views Hardware» more  DATE 2003»
14 years 2 months ago
NPSE: A High Performance Network Packet Search Engine
This paper describes the NPSE, a high-performance SRAM-based network packet search engine which has the primary application of supporting IPv4 and IPv6 forwarding. It is based on ...
Naresh Soni, Nick Richardson, Lun Bin Huang, Sures...
JUCS
2008
123views more  JUCS 2008»
13 years 9 months ago
Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
Ricardo Santos, Rodolfo Azevedo, Guido Araujo
TSMC
2008
222views more  TSMC 2008»
13 years 9 months ago
Improving Iris Recognition Performance Using Segmentation, Quality Enhancement, Match Score Fusion, and Indexing
Abstract--This paper proposes algorithms for iris segmentation, quality enhancement, match score fusion, and indexing to improve both the accuracy and the speed of iris recognition...
Mayank Vatsa, Richa Singh, Afzel Noore