85 search results - page 10 / 17 » Non Uniform Random Walks |
RSA
2011
13 years 4 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
ICST
2010
IEEE
13 years 8 months ago
2010
IEEE
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
PAMI
2006
13 years 9 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
INFOCOM
2012
IEEE
12 years 7 days 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...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...