Sciweavers

1017 search results - page 197 / 204
» Some existence and construction results of polygonal designs
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 7 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 7 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
CCS
2009
ACM
14 years 2 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
14 years 1 months ago
Bringing evolutionary computation to industrial applications with guide
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
Luís Da Costa, Marc Schoenauer
INFOCOM
2008
IEEE
14 years 1 months ago
On Reducing Mesh Delay for Peer-to-Peer Live Streaming
—Peer-to-peer (P2P) technology has emerged as a promising scalable solution for live streaming to large group. In this paper, we address the design of overlay which achieves low ...
Dongni Ren, Y.-T. Hillman Li, Shueng-Han Gary Chan