26 search results - page 4 / 6 » Fast Algorithms for Computing the Tripartition-Based Distanc... |
WSDM
2010
ACM
14 years 5 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
BMCBI
2006
13 years 7 months ago
2006
Background: Despite their involvement in the regulation of gene expression and their importance as genomic markers for promoter prediction, no objective standard exists for defini...
DC
2010
13 years 7 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
WONS
2005
IEEE
14 years 1 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
NCA
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...