Sciweavers

264 search results - page 21 / 53
» On Linear Cryptanalysis with Many Linear Approximations
Sort
View
CORR
2012
Springer
217views Education» more  CORR 2012»
13 years 9 months ago
An Adaptive Mechanism for Accurate Query Answering under Differential Privacy
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
Chao Li, Gerome Miklau
IJCAI
1997
15 years 2 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
KES
2005
Springer
15 years 7 months ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura
CVPR
2010
IEEE
15 years 9 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
RTSS
2006
IEEE
15 years 7 months ago
Distributed Real-Time Detection and Tracking of Homogeneous Regions in Sensor Networks
In many applications we can deploy large number of sensors spanning wide geographical areas, to monitor environmental phenomena. The analysis of the data collected by such sensor ...
Sharmila Subramaniam, Vana Kalogeraki, Themis Palp...