Sciweavers

851 search results - page 153 / 171
» Random constructions and density results
Sort
View
RECOMB
2007
Springer
14 years 7 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
ICC
2008
IEEE
167views Communications» more  ICC 2008»
14 years 1 months ago
Traceroute-Based Topology Inference without Network Coordinate Estimation
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
IMC
2006
ACM
14 years 1 months ago
Comprehensive view of a live network coding P2P system
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
Christos Gkantsidis, John Miller, Pablo Rodriguez
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 2 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu