Sciweavers

661 search results - page 81 / 133
» Argument Reduction by Factoring
Sort
View
DCC
2008
IEEE
15 years 9 months ago
Improved versions of Tardos' fingerprinting scheme
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
Oded Blayer, Tamir Tassa
ESA
2009
Springer
104views Algorithms» more  ESA 2009»
15 years 4 months ago
Improved Approximation Algorithms for Label Cover Problems
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J...
EUROPAR
2009
Springer
15 years 4 months ago
Adaptive Parallel Householder Bidiagonalization
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
Fangbin Liu, Frank J. Seinstra
ICC
2008
IEEE
15 years 4 months ago
MMSE Soft-Interference-Cancellation Aided Iterative Center-Shifting K-Best Sphere Detection for MIMO Channels
—Based on an EXtrinsic Information Transfer (EXIT) chart-assisted receiver design, a low-complexity near-Maximum A Posteriori (MAP) detector is constructed for high-throughput sy...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
15 years 4 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell