Sciweavers

932 search results - page 115 / 187
» Sequence Complexity for Biological Sequence Analysis
Sort
View
ICC
2007
IEEE
107views Communications» more  ICC 2007»
14 years 3 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 ...
BMCBI
2010
189views more  BMCBI 2010»
13 years 9 months 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,...
ANCS
2005
ACM
14 years 2 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
14 years 3 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...
FOCS
1995
IEEE
14 years 23 days 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