Sciweavers

881 search results - page 120 / 177
» Secure Personal Data Servers: a Vision Paper
Sort
View
140
Voted
SOSP
2007
ACM
15 years 10 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
123
Voted
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
16 years 2 months ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 2 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 2 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
16 years 2 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...