Sciweavers

4315 search results - page 117 / 863
» Sorting in linear time
Sort
View
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 10 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
EUROPAR
2010
Springer
13 years 9 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
CDC
2009
IEEE
181views Control Systems» more  CDC 2009»
14 years 1 months ago
Stability of switched linear systems and the convergence of random products
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
Ning Wang, Magnus Egerstedt, Clyde F. Martin
DC
2010
13 years 9 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
ICASSP
2011
IEEE
13 years 23 days ago
Linear IIR-MMSE precoding for frequency selective MIMO channels
We consider the design of linear precoding filters with respect to the minimum mean square error (MMSE) criterion for systems that employ an additional scalar gain next to a fix...
Sander Wahls, Holger Boche