Sciweavers

2996 search results - page 30 / 600
» Numberings and Randomness
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Low-complexity receivers for multiuser detection with an unknown number of active users
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...
Daniele Angelosante, Ezio Biglieri
IPPS
2005
IEEE
14 years 3 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 9 months ago
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
Richard Arratia
CORR
2012
Springer
191views Education» more  CORR 2012»
12 years 5 months ago
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
Patrick Bindjeme, James Allen Fill
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
14 years 3 months ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof