Sciweavers

2996 search results - page 187 / 600
» Numberings and Randomness
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 4 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi
SPAA
1998
ACM
15 years 10 months ago
Analyses of Load Stealing Models Based on Differential Equations
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
Michael Mitzenmacher
BMCBI
2008
58views more  BMCBI 2008»
15 years 6 months ago
Recovering probabilities for nucleotide trimming processes for T cell receptor TRA and TRG V-J junctions analyzed with IMGT tool
Background: Nucleotides are trimmed from the ends of variable (V), diversity (D) and joining (J) genes during immunoglobulin (IG) and T cell receptor (TR) rearrangements in B cell...
Kevin Bleakley, Marie-Paule Lefranc, Gérard...
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 6 months ago
Matching with Couples Revisited
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
Itai Ashlagi, Mark Braverman, Avinatan Hassidim
MP
2002
93views more  MP 2002»
15 years 6 months ago
Conditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
Alexander Shapiro, Tito Homem-de-Mello, Joocheol K...