Sciweavers

4860 search results - page 890 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
14 years 3 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 2 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
14 years 1 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan
KDD
2010
ACM
253views Data Mining» more  KDD 2010»
14 years 1 months ago
Mining periodic behaviors for moving objects
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could b...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, P...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 11 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets