1949 search results - page 96 / 390 » Random graphs on surfaces |
263
click to vote
3DIM
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...
139
click to vote
JSAC
2007
15 years 4 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
137
click to vote
IV
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper introduces Temporal Social Surfaces. Temporal Social Surfaces show the dynamic evolution of social relationships in groups. Changes in measures of social network analys...
117
click to vote
SIGCOMM
2009
ACM
15 years 10 months ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
134
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...