379 search results - page 1 / 76 » Strong reducibility of partial numberings |
AML
2005
13 years 5 months ago
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
SIGOPSE
2004
ACM
13 years 10 months ago
2004
ACM
Web application workloads are often characterized by a large number of unique read requests and a significant fraction of write requests. Hosting these applications drives the ne...
BMCBI
2007
13 years 5 months ago
2007
Background: When conducting multiple hypothesis tests, it is important to control the number of false positives, or the False Discovery Rate (FDR). However, there is a tradeoff be...
COMBINATORICS
2006
13 years 5 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
– In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system,...