Sciweavers

5580 search results - page 287 / 1116
» Randomized priority algorithms
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 2 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
INFOCOM
2012
IEEE
13 years 9 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
16 years 20 days ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
DAC
2008
ACM
16 years 7 months ago
Modeling of failure probability and statistical design of spin-torque transfer magnetic random access memory (STT MRAM) array fo
: Spin-Torque Transfer Magnetic RAM (STT MRAM) is a promising candidate for future universal memory. It combines the desirable attributes of current memory technologies such as SRA...
Jing Li, Charles Augustine, Sayeef S. Salahuddin, ...
DATE
2008
IEEE
204views Hardware» more  DATE 2008»
16 years 29 days ago
Deep Submicron Interconnect Timing Model with Quadratic Random Variable Analysis
Shrinking feature sizes and process variations are of increasing concern in modern technology. It is urgent that we develop statistical interconnect timing models which are harmon...
Jun-Kuei Zeng, Chung-Ping Chen