We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
Abstract. For discrete-time linear systems over a principal ideal domain, three types of (C, A)invariance can be distinguished. Connections between these notions are investigated. ...
For odd integer m ≥ 3 and t = 0, 1, . . . , m−1 2 , we define Family V (t) to be a set of size 2m(t+1) containing binary sequences of period 2m+1 − 2. The nontrivial correl...
— This paper shows that the k-means quantization of a signal can be interpreted both as a crisp indicator function and as a fuzzy membership assignment describing fuzzy clusters ...
Inference methods for detecting attacks on information resources typically use signature analysis or statistical anomaly detection methods. The former have the advantage of attack...