107 search results - page 12 / 22 » Lower Bounds for Sparse Recovery |
ICDAR
2007
IEEE
15 years 8 months ago
2007
IEEE
Non-linear warping appears in document images when captured by a digital camera or a scanner, especially in the case that these documents are digitized bounded volumes. Arbitraril...
130
click to vote
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
131
click to vote
MFCS
2010
Springer
15 years 10 days ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
121
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
104
click to vote
CORR
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...