A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities du...
Chunming Li, Chenyang Xu, Changfeng Gui, Martin D....
The Discrete Pascal Transform (DPT) has been proved remarkably useful for edge detection, filter design, discrete-time signal interpolation and data hiding. In the present work a n...
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...