Sciweavers

6251 search results - page 347 / 1251
» Randomness, Computability, and Density
Sort
View
TWC
2008
133views more  TWC 2008»
15 years 6 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
JAL
2002
113views more  JAL 2002»
15 years 6 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
JC
2011
87views more  JC 2011»
15 years 1 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
BMCBI
2011
15 years 1 months ago
Phenotype Recognition with Combined Features and Random Subspace Classifier Ensemble
Background: Automated, image based high-content screening is a fundamental tool for discovery in biological science. Modern robotic fluorescence microscopes are able to capture th...
Bailing Zhang, Tuan D. Pham
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
14 years 6 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan