1480 search results - page 180 / 296 » Distributed algorithms for weighted problems in sparse graph... |
105
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
144
click to vote
AAIM
2008
Springer
15 years 2 months ago
2008
Springer
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
NETWORKING
2008
15 years 2 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
105
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
94
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...