Sciweavers

426 search results - page 65 / 86
» Run lengths and liquidity
Sort
View
ICC
2011
IEEE
185views Communications» more  ICC 2011»
12 years 9 months ago
An Information-Theoretic Approach to Accelerated Simulation of Hybrid-ARQ Systems
—In order to reduce the long runtimes required to simulate hybrid automatic repeat-request (ARQ) systems, such as high-speed downlink packet access (HSDPA), we propose an informa...
Matthew C. Valenti
PODC
2009
ACM
14 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
BMCBI
2010
88views more  BMCBI 2010»
13 years 10 months ago
FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
Guimei Liu, Yue Wang, Limsoon Wong
BMCBI
2005
108views more  BMCBI 2005»
13 years 9 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
ALGORITHMICA
2011
13 years 4 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal