Sciweavers

6251 search results - page 13 / 1251
» Randomness, Computability, and Density
Sort
View
RSA
2008
78views more  RSA 2008»
13 years 8 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
CORR
2000
Springer
71views Education» more  CORR 2000»
13 years 8 months ago
Smoothness and decay properties of the limiting Quicksort density function
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere ...
James Allen Fill, Svante Janson
RSA
2006
69views more  RSA 2006»
13 years 8 months ago
On smoothed analysis in dense graphs and formulas
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
Michael Krivelevich, Benny Sudakov, Prasad Tetali
INFOCOM
2006
IEEE
14 years 2 months ago
Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?
— Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintain...
Honghai Zhang, Jennifer C. Hou
SAC
2010
ACM
14 years 3 months ago
Tracking random finite objects using 3D-LIDAR in marine environments
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
Kwang Wee Lee, Bharath Kalyan, W. Sardha Wijesoma,...