Sciweavers

1612 search results - page 79 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 3 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
CPC
2006
93views more  CPC 2006»
14 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
PR
2011
14 years 19 days ago
Content-based image retrieval with relevance feedback using random walks
In this paper we propose a novel approach to content-based image retrieval with relevance feedback, which is based on the random walker algorithm introduced in the context of inte...
Samuel Rota Bulò, Massimo Rabbi, Marcello P...
INFOCOM
2007
IEEE
15 years 4 months ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang
ANCS
2009
ACM
14 years 7 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin