Sciweavers

Share
7 search results - page 1 / 2
» Improved bounds for cops-and-robber pursuit
Sort
View
COMGEO
2011
ACM
9 years 2 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
CORR
2010
Springer
127views Education» more  CORR 2010»
9 years 7 months ago
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
Joseph Shtok, Michael Elad
CORR
2008
Springer
186views Education» more  CORR 2008»
9 years 7 months ago
Greedy Signal Recovery Review
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
Deanna Needell, Joel A. Tropp, Roman Vershynin
ICIP
2002
IEEE
10 years 8 months ago
Matching pursuits video coding using generalized bit-planes
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...
Alexandre G. Ciancio, Eduardo A. B. da Silva, Rog&...
JMLR
2010
119views more  JMLR 2010»
9 years 1 months ago
The Group Dantzig Selector
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
Han Liu, Jian Zhang 0003, Xiaoye Jiang, Jun Liu
books