1871 search results - page 87 / 375 » The Ephemeral Pairing Problem |
SIAMCOMP
2008
14 years 11 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
CANDC
2005
ACM
14 years 11 months ago
2005
ACM
Given an assembled genome of a diploid organism the haplotype assembly problem can be formulated as retrieval of a pair of haplotypes from a set of aligned weighted SNP fragments....
100
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The multi-layer bit-wise unequal error protection problem is considered for variable length block codes with feedback. Inner and outer bounds are derived for achievable performanc...
103
click to vote
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
Abstract—We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization o...
IWPEC
2009
Springer
15 years 5 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...