2899 search results - page 356 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
189
click to vote
MM
2004
ACM
15 years 12 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
175
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
177
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
162
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
155
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...