Sciweavers

221 search results - page 25 / 45
» Computing arbitrary functions of encrypted data
Sort
View
ICCV
1999
IEEE
14 years 9 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
14 years 2 months ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng
ICASSP
2008
IEEE
14 years 2 months ago
Blind optimization of algorithm parameters for signal denoising by Monte-Carlo SURE
We consider the problem of optimizing the parameters of an arbitrary denoising algorithm by minimizing Stein’s Unbiased Risk Estimate (SURE) which provides a means of assessing ...
Sathish Ramani, Thierry Blu, Michael Unser
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 11 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
GRAPHITE
2003
ACM
14 years 27 days ago
Smooth surface reconstruction from noisy range data
This paper shows that scattered range data can be smoothed at low cost by fitting a Radial Basis Function (RBF) to the data and convolving with a smoothing kernel (low pass filt...
Jonathan C. Carr, Richard K. Beatson, Bruce C. McC...