Sciweavers

1579 search results - page 152 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
STOC
2002
ACM
117views Algorithms» more  STOC 2002»
16 years 6 months ago
Hardness amplification within NP
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...
Ryan O'Donnell
DCC
2001
IEEE
16 years 6 months ago
The Invariants of the Clifford Groups
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). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
HYBRID
2009
Springer
16 years 1 months ago
Optimization of Multi-agent Motion Programs with Applications to Robotic Marionettes
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...
Patrick Martin, Magnus Egerstedt
ICASSP
2009
IEEE
16 years 1 months ago
Modeling of contours in wavelet domain for generalized lifting image compression
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
SEKE
2009
Springer
16 years 28 days ago
Extending AOP to Support Broad Runtime Monitoring Needs
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...
Amjad Nusayr, Jonathan Cook