Sciweavers

237 search results - page 22 / 48
» MapReduce for Integer Factorization
Sort
View
GLOBECOM
2008
IEEE
14 years 5 months ago
A Maximum-Likelihood Decoder with a New Reduction Strategy for MIMO Channel Systems
—An efficient maximum-likelihood decoder with a new reduction strategy is proposed for linear MIMO channel systems. Unlike the current reduction strategies which only reorder th...
Xiao-Wen Chang, Xiaohua Yang
COCOON
2005
Springer
14 years 4 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
14 years 3 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
ANTS
1994
Springer
83views Algorithms» more  ANTS 1994»
14 years 3 months ago
On orders of optimal normal basis generators
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
Shuhong Gao, Scott A. Vanstone
STOC
1993
ACM
179views Algorithms» more  STOC 1993»
14 years 3 months ago
The network inhibition problem
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
Cynthia A. Phillips