Sciweavers

1949 search results - page 111 / 390
» Random graphs on surfaces
Sort
View
FOCS
2003
IEEE
15 years 9 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ML
2010
ACM
141views Machine Learning» more  ML 2010»
15 years 2 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
CPC
2010
122views more  CPC 2010»
15 years 4 months ago
The Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
Louigi Addario-Berry, Nicolas Broutin, Gábo...
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
15 years 11 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
TOG
2008
149views more  TOG 2008»
15 years 4 months ago
Randomized cuts for 3D mesh analysis
The goal of this paper is to investigate a new shape analysis method based on randomized cuts of 3D surface meshes. The general strategy is to generate a random set of mesh segmen...
Aleksey Golovinskiy, Thomas A. Funkhouser