1095 search results - page 21 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
Pervasive Computing envisions distributed applications that optimally leverage the resources present in their ever-changing execution environment. To ease the development of perva...
PATAT
2004
Springer
14 years 23 days ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. ...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...