Sciweavers

3413 search results - page 562 / 683
» New Support Vector Algorithms
Sort
View
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
16 years 2 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
POPL
2003
ACM
16 years 2 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
123
Voted
SAC
2010
ACM
15 years 9 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
16 years 2 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 2 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith