2079 search results - page 49 / 416 » Universality of random graphs |
127
click to vote
RSA
2006
15 years 3 months ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
138
click to vote
ALGOSENSORS
2007
Springer
15 years 10 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
154
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a novel approach for improving level set seg-
mentation methods by embedding the potential functions
from a discriminatively trained conditional random field
(CRF) in...
149
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
135
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...