6251 search results - page 21 / 1251 » Randomness, Computability, and Density |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
IPL
2006
13 years 8 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
TIT
2008
13 years 8 months ago
2008
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
JMIV
2002
13 years 8 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
ICMLA
2007
13 years 10 months ago
2007
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...