Sciweavers

10901 search results - page 339 / 2181
» Approximations in Distributed Optimization
Sort
View
IEICET
2008
95views more  IEICET 2008»
15 years 6 months ago
Approximating the Best Linear Unbiased Estimator of Non-Gaussian Signals with Gaussian Noise
Obtaining the best linear unbiased estimator (BLUE) of noisy signals is a traditional but powerful approach to noise reduction. Explicitly computing the BLUE usually requires the ...
Masashi Sugiyama, Motoaki Kawanabe, Gilles Blancha...
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
ISCI
2010
118views more  ISCI 2010»
15 years 5 months ago
Approximations of upper and lower probabilities by measurable selections
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
Enrique Miranda, Inés Couso, Pedro Gil
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 10 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
IPMU
2010
Springer
15 years 10 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin