3244 search results - page 45 / 649 » On convex complexity measures |
TIP
1998
14 years 11 months ago
1998
—We present a method of estimating the shape of a weakly scattering binary convex polygonal object from the backscattered field. We use the concept scattering centers where it h...
104
click to vote
TIT
2010
14 years 6 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
CIE
2005
Springer
15 years 4 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
126
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
IPL
2008
14 years 11 months ago
2008
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...