Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

105

Voted

JCSS
2008

84views more JCSS 2008»

Computational complexity of auditing finite attributes in statistical databases

15 years 2 months ago

Computational complexity of auditing finite attributes in statistical databases

Download www.dur.ac.uk

Peter Jonsson, Andrei A. Krokhin

Real-time Traffic

JCSS 2008 |

claim paper

Related Content

» Auditing Boolean Attributes

» An Algebraic Approach to the Complexity of Generalized Conjunctive Queries

» Effective pvalue computations using Finite Markov Chain Imbedding FMCI application to loca...

» Detecting Attribute Dependencies from Query Feedback

» Monadic datalog over finite structures with bounded treewidth

» Selectivity Estimation using Probabilistic Models

» Processing complex aggregate queries over data streams

» Efficient and effective explanation of change in hierarchical summaries

» ADtrees for Fast Counting and for Fast Learning of Association Rules

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCSS
Authors	Peter Jonsson, Andrei A. Krokhin

Comments (0)