32 search results - page 6 / 7 » Approximate Distance Oracles for Graphs with Dense Clusters |
179
Voted
WDAG
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
180
Voted
ALMOB
2006
15 years 6 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
141
Voted
TOSN
2010
15 years 4 months ago
2010
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
162
click to vote
AFRIGRAPH
2003
ACM
15 years 9 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
159
click to vote
INFOCOM
2006
IEEE
16 years 4 days ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...