1095 search results - page 93 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
165
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
123
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
105
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
140
Voted
CW
2008
IEEE
15 years 9 months ago
2008
IEEE
Dematerialized music and MP3 players offer to the user the possibility of carrying his musical content everywhere. However, at home, the music collection is generally not central...
141
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
1 Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as at...