We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Abstract. In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic co...
This paper introduces the design of context-based models of contours in the wavelet domain, which are used to construct generalized lifting (GL) mappings for image compression. Th...
Julio C. Rolon, Antonio Ortega, Philippe Salembier
Abstract—Runtime monitoring, where some part of a program’s behavior and/or data is observed during execution, is a very useful technique that software developers to use for un...