1972 search results - page 190 / 395 » connection 2008 |
183
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Semantic overlay networks cluster peers that are semantically, thematically or socially close into groups by means of a rewiring procedure that is periodically executed by each pe...
170
click to vote
CSCW
2008
ACM
15 years 8 months ago
2008
ACM
Within a group of peers, it is often useful or interesting to know whether someone in the group has gone to bed or whether they have awakened in the morning. This information, nat...
170
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
163
click to vote
DOCENG
2008
ACM
15 years 8 months ago
2008
ACM
As the world wide web transforms from a vehicle of information dissemination and e-commerce transactions into a writable nexus of human collaboration, the Web 2.0 technologies at ...
180
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...