4234 search results - page 833 / 847 » Clustering in cooperative networks |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
167
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
181
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...