376 search results - page 53 / 76 » Completely connected clustered graphs |
TMC
2011
13 years 2 months ago
2011
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
PAMI
2012
11 years 10 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
Kahn defined a formal model for networks of processes that communicate through channels carrying streams of data tokens. His mathematical results show the necessary conditions fo...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...