1763 search results - page 51 / 353 » Dependent random choice |
158
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
125
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
115
click to vote
CPC
2006
15 years 3 months ago
2006
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
172
click to vote
RSA
2006
15 years 3 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
161
click to vote
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...