Sciweavers

932 search results - page 115 / 187
» Sequence Complexity for Biological Sequence Analysis
Sort
View
89
Voted
ICC
2007
IEEE
107views Communications» more  ICC 2007»
15 years 7 months ago
MLSE for DSTBC-OFDM Detection with Channel Estimation by Blind Linear Prediction and Subcarriers Interpolation
— This paper proposes low-complexity blind detection for orthogonal frequency division multiplexing (OFDM) systems with the differential space-time block code (DSTBC) under time-...
Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi ...
116
Voted
BMCBI
2010
189views more  BMCBI 2010»
15 years 28 days ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
108
Voted
ANCS
2005
ACM
15 years 6 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
IISWC
2008
IEEE
15 years 7 months ago
Temporal streams in commercial server applications
Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, ...
Thomas F. Wenisch, Michael Ferdman, Anastasia Aila...
104
Voted
FOCS
1995
IEEE
15 years 4 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth