Sciweavers

522 search results - page 34 / 105
» Fast Smith-Waterman hardware implementation
Sort
View
INFOCOM
1995
IEEE
13 years 11 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Porting Decision Tree Algorithms to Multicore using FastFlow
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
Marco Aldinucci, Salvatore Ruggieri, Massimo Torqu...
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
14 years 2 months ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
ISCAS
2006
IEEE
122views Hardware» more  ISCAS 2006»
14 years 1 months ago
Design of a practical scheme for ultra wideband communication
—In the design of a packet-oriented impulse-radio UWB communication system, the main challenge at the receiver is to have a fast synchronization to the coded pulses, along with a...
Yiyin Wang, R. van Leuken, Alle-Jan van der Veen