Sciweavers

800 search results - page 68 / 160
» Gaussian random number generators
Sort
View
SPAA
2010
ACM
13 years 8 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
TWC
2008
133views more  TWC 2008»
13 years 8 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,...
SIGKDD
2010
128views more  SIGKDD 2010»
13 years 2 months ago
On cross-validation and stacking: building seemingly predictive models on random data
A number of times when using cross-validation (CV) while trying to do classification/probability estimation we have observed surprisingly low AUC's on real data with very few...
Claudia Perlich, Grzegorz Swirszcz
AAAI
1997
13 years 9 months ago
Variable-Selection Heuristics in Local Search for SAT
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
Alex S. Fukunaga
BMCBI
2006
141views more  BMCBI 2006»
13 years 8 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...