7 search results - page 1 / 2 » Improved bounds for cops-and-robber pursuit |
COMGEO
2011
ACM
12 years 11 months ago
2011
ACM
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/...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
ICIP
2002
IEEE
14 years 6 months ago
2002
IEEE
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...
JMLR
2010
12 years 11 months ago
2010
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...