598 search results - page 78 / 120 » A random graph model for massive graphs |
138
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
133
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
150
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
140
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...