2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.IT2015
On the Doubly Sparse Compressed Sensing Problem
Grigory Kabatiansky, Cedric Tavernier, Serge Vladuts
A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restricti…
cs.CR2009★ 2 cited
Finding passwords by random walks: How long does it take?
G. Kabatiansky, G. Oshanin
We compare an efficiency of a deterministic "lawnmower" and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are…