Sciweavers

1578 search results - page 51 / 316
» Algorithmic randomness of continuous functions
Sort
View
FOCM
2008
156views more  FOCM 2008»
13 years 11 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
15 years 11 days ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...
ICIP
2001
IEEE
15 years 18 days ago
Disparity map restoration by integration of confidence in Markov random fields models
This paper proposes some Markov Random Field (MRF) models for restoration of stereo disparity maps. The main aspect is the use of confidence maps provided by the Symmetric Multipl...
Andrea Fusiello, Umberto Castellani, Vittorio Muri...
ICTAI
2005
IEEE
14 years 4 months ago
An Adaptive De-Blocking Algorithm Based on MRF
One of the major drawbacks in block-based discrete cosine transform (BDCT) is the blocking artifacts at low bit rates. In this paper, an adaptive deblocking algorithm based on Mar...
Shengli Xie, Zhiliang Xu
CCA
2005
Springer
14 years 1 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi