2638 search results - page 85 / 528 » Random Geometric Complexes |
117
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
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...
145
click to vote
JCST
2010
14 years 11 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
124
click to vote
CAAN
2004
Springer
15 years 9 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
263
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
149
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...