3708 search results - page 59 / 742 » Approximating Betweenness Centrality |
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
SPIRE
2009
Springer
14 years 5 months ago
2009
Springer
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
MEMOCODE
2003
IEEE
14 years 4 months ago
2003
IEEE
Formal techniques have been widely applied in the design of real-time systems and have significantly helped detect design errors by checking real-time properties of the model. Ho...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
RSA
2010
13 years 9 months ago
2010
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...