Sciweavers

3497 search results - page 573 / 700
» Making Distributed Applications Robust
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 5 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 5 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
162
Voted
KDD
2003
ACM
266views Data Mining» more  KDD 2003»
16 years 5 months ago
Applying data mining in investigating money laundering crimes
In this paper, we study the problem of applying data mining to facilitate the investigation of money laundering crimes (MLCs). We have identified a new paradigm of problems --- th...
Zhongfei (Mark) Zhang, John J. Salerno, Philip S. ...
OSDI
2002
ACM
16 years 4 months ago
Optimizing the Migration of Virtual Computers
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...
Constantine P. Sapuntzakis, Ramesh Chandra, Ben Pf...
239
Voted
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
16 years 4 months ago
Multi-tenant databases for software as a service: schema-mapping techniques
In the implementation of hosted business services, multiple tenants are often consolidated into the same database to reduce total cost of ownership. Common practice is to map mult...
Stefan Aulbach, Torsten Grust, Dean Jacobs, Alfons...