Sciweavers

190 search results - page 14 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
14 years 25 days ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
ICCV
2009
IEEE
1297views Computer Vision» more  ICCV 2009»
14 years 6 months ago
Effective and Efficient Interpolation for Mutual Information based Multimodality Elastic Image Registration
Mutual information (MI) is a popular similarity metric for multimodality image registration purpose. However, it is negatively influenced by artifacts due to interpolation effec...
R. Gallea, E. Ardizzone, R. Pirrone, O. Gambino
ICFP
2009
ACM
14 years 8 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
JMLR
2002
115views more  JMLR 2002»
13 years 7 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger