2370 search results - page 239 / 474 » The Characterization of Data-Accumulating Algorithms |
113
click to vote
ANOR
2010
15 years 4 months ago
2010
Many image denoising methods can be characterized as minimizing "loss + penalty," where the "loss" measures the fidelity of the denoised image to the data, and ...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
105
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
143
click to vote
CSDA
2010
15 years 4 months ago
2010
Kernel Principal Component Analysis extends linear PCA from a Euclidean space to any reproducing kernel Hilbert space. Robustness issues for Kernel PCA are studied. The sensitivit...