598 search results - page 31 / 120 » The Structure of Sparse Resultant Matrices |
105
Voted
AC
2003
Springer
15 years 9 months ago
2003
Springer
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We prese...
156
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
152
Voted
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
157
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
117
Voted
CGF
2004
15 years 3 months ago
2004
We propose a new strategy to estimate surface normal information from highly noisy sparse data. Our approach is based on a tensor field morphologically adapted to infer normals. I...