Sciweavers

376 search results - page 51 / 76
» Betweenness Centrality : Algorithms and Lower Bounds
Sort
View
WCNC
2008
IEEE
14 years 2 months ago
A Novel Capacity Analysis for Wireless Backhaul Mesh Networks
—This paper presents a novel ring-based approach to analyze the inter-flow capacity of a backhaul wireless mesh networks (WMNs) with centralized scheduling. Based on the property...
Tein-Yaw D. Chung, Kuan-Chun Lee, Hsiao-Chih Georg...
IPPS
2000
IEEE
14 years 2 days ago
Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
Suchendra M. Bhandarkar, Salem Machaka, Sanjay She...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
13 years 9 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
COLT
2010
Springer
13 years 5 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 5 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...