Sciweavers

152 search results - page 2 / 31
» {Algorithmic Minimal Sufficient Statistics: a New Definition
Sort
View
ECIS
2003
13 years 6 months ago
Towards definitive benchmarking of algorithm performance
One of the primary methods employed by researchers to judge the merits of new heuristics and algorithms is to run them on accepted benchmark test cases and comparing their perform...
Andrew Lim, Wee-Chong Oon, Wenbin Zhu
COMPUTING
2006
126views more  COMPUTING 2006»
13 years 5 months ago
Algebraic Multigrid Based on Computational Molecules, 1: Scalar Elliptic Problems
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into the sum of edge matrices thereby assumi...
J. K. Kraus, Josef Schicho
CCS
2009
ACM
13 years 2 months ago
RFID privacy: relation between two notions, minimal condition, and efficient construction
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
Changshe Ma, Yingjiu Li, Robert H. Deng, Tieyan Li
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 5 months ago
Differential privacy and robust statistics
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
Cynthia Dwork, Jing Lei
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 5 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi