Sciweavers

461 search results - page 11 / 93
» Higher Kurtz randomness
Sort
View
79
Voted
ICDT
2007
ACM
87views Database» more  ICDT 2007»
15 years 3 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi
ET
2002
84views more  ET 2002»
14 years 9 months ago
Hardware Generation of Random Single Input Change Test Sequences
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
René David, Patrick Girard, Christian Landr...
105
Voted
ICC
2009
IEEE
129views Communications» more  ICC 2009»
15 years 4 months ago
Random Access Protocols for WLANs Based on Mechanism Design
— In wireless local area networks (WLANs), quality of service (QoS) can be provided by mapping applications with different requirements (e.g., delay and throughput) into one of t...
Man Hon Cheung, Amir Hamed Mohsenian Rad, Vincent ...
83
Voted
HIPC
1999
Springer
15 years 1 months ago
Stochastic Modeling of TCP/IP over Random Loss Channels
An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented that is based on a semi-Markov model for the window ...
Alhussein A. Abouzeid, Murat Azizoglu, Sumit Roy
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
14 years 11 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan