Sciweavers

3208 search results - page 332 / 642
» A Lower Bound for Primality
Sort
View
CORR
2007
Springer
106views Education» more  CORR 2007»
15 years 6 months ago
Capacity of Underspread Noncoherent WSSUS Fading Channels under Peak Signal Constraints
— We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading chan...
Giuseppe Durisi, Helmut Bölcskei, Shlomo Sham...
CORR
2007
Springer
91views Education» more  CORR 2007»
15 years 6 months ago
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
We propose an information–theoretic approach to the watermark embedding and detection under limited detector resources. First, we present asymptotically optimal decision regions...
Neri Merhav, Erez Sabbag
IPL
2006
69views more  IPL 2006»
15 years 6 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
JC
2006
68views more  JC 2006»
15 years 6 months ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich
211
Voted
IDA
2007
Springer
15 years 6 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando