Sciweavers

138 search results - page 14 / 28
» A Generalized Sampling Theorem for Reconstructions in Arbitr...
Sort
View
DAM
2008
102views more  DAM 2008»
13 years 6 months ago
Formulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. ...
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
11 years 9 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
ICASSP
2011
IEEE
12 years 10 months ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes
3DPVT
2002
IEEE
145views Visualization» more  3DPVT 2002»
13 years 11 months ago
Multiresolution Distance Volumes for Progressive Surface Compression
We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topolo...
Daniel E. Laney, Martin Bertram, Mark A. Duchainea...
SIGGRAPH
2000
ACM
13 years 11 months ago
Progressive geometry compression
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...
Andrei Khodakovsky, Peter Schröder, Wim Sweld...