Sciweavers

653 search results - page 46 / 131
» Using common random numbers for indifference-zone selection
Sort
View
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
13 years 11 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
ACSAC
2010
IEEE
13 years 5 months ago
Defending DSSS-based broadcast communication against insider jammers via delayed seed-disclosure
Spread spectrum techniques such as Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping (FH) have been commonly used for anti-jamming wireless communication. However, trad...
An Liu, Peng Ning, Huaiyu Dai, Yao Liu, Cliff Wang
GIS
2007
ACM
13 years 11 months ago
Randomization in traffic information sharing systems
In this paper, we consider a traffic information sharing system based on Floating Car Data (FCD). FCD is one of the methods used to gather traffic information; it uses vehicles as...
Masaaki Tanizaki, Ouri Wolfson
SPAA
2010
ACM
13 years 7 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
JCB
2008
94views more  JCB 2008»
13 years 7 months ago
Prioritize and Select SNPs for Association Studies with Multi-Stage Designs
Large-scale whole genome association studies are increasingly common, due in large part to recent advances in genotyping technology. With this change in paradigm for genetic studi...
Jing Li