Sciweavers

4820 search results - page 952 / 964
» Clustering Social Networks
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 2 months ago
Camouflaged fraud detection in domains with complex relationships
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...
Sankar Virdhagriswaran, Gordon Dakin
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
16 years 2 months ago
Data currency in replicated DHTs
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 ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
SIGMOD
2004
ACM
151views Database» more  SIGMOD 2004»
16 years 2 months ago
Highly-Available, Fault-Tolerant, Parallel Dataflows
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...
Mehul A. Shah, Joseph M. Hellerstein, Eric A. Brew...
144
Voted
SC
2009
ACM
15 years 8 months ago
Kestrel: an XMPP-based framework for many task computing applications
This paper presents a new distributed computing framework for Many Task Computing (MTC) applications, based on the Extensible Messaging and Presence Protocol (XMPP). A lightweight...
Lance Stout, Michael A. Murphy, Sebastien Goasguen
CCGRID
2008
IEEE
15 years 8 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...