Sciweavers

49 search results - page 9 / 10
» Computing Inverse ST in Linear Complexity
Sort
View
CISS
2008
IEEE
13 years 11 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
SIAMREV
2011
63views more  SIAMREV 2011»
12 years 8 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
CN
2007
141views more  CN 2007»
13 years 5 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
CVPR
2010
IEEE
13 years 8 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
STACS
1999
Springer
13 years 9 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...