Sciweavers

432 search results - page 31 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
CSR
2006
Springer
15 years 5 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
EDOC
2006
IEEE
15 years 5 months ago
A Fast and Efficient Route Finding Method for Car Navigation Systems with Neural Networks
In this paper we have proposed a new route finding method for car navigation systems meanwhile, have utilized learning power and high speed of neural networks in our proposed meth...
Mehdi Hashemzadeh
INFOCOM
2011
IEEE
14 years 5 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
151
Voted
HPCA
2012
IEEE
13 years 9 months ago
Balancing DRAM locality and parallelism in shared memory CMP systems
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...
DATE
2003
IEEE
180views Hardware» more  DATE 2003»
15 years 7 months ago
Communication Centric Architectures for Turbo-Decoding on Embedded Multiprocessors
Software implementations of channel decoding algorithms are attractive for communication systems with their large variety of existing and emerging standards due to their flexibil...
Frank Gilbert, Michael J. Thul, Norbert Wehn