Browsing by Keywords "Upper bound"

Now showing items 1-5 of 5

    • Dwell time optimization in switching control of parameter varying time delay systems 

      Yan, P.; Özbay, Hitay; Şansal, M. (IEEE, 2011)
      It has been shown that parameter varying systems with time delays can be robustly stabilized by switching control, provided that the plant's parameter varies slowly enough such that the dwell time conditions of the switched ...

    • An improved graph-entropy bound for perfect hashing 

      Arıkan, Erdal (IEEE, 1994-06-07)
      Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances.

    • An information-theoretic analysis of Grover's algorithm 

      Arıkan, Erdal (IEEE, 2003-06-07)
      Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately 1r/4VN queries to a quantum oracle. For classical search using a classical oracle, the ...

    • Noise enhanced detection in multiple-access environments 

      Bayram, Suat; Gezici, Sinan (IEEE, 2009)
      Under certain conditions, addition of noise can enhance performance of suboptimal detectors, which is called the stochastic resonance (SR) effect. In this paper, the effects of SR are investigated for conventional detectors ...

    • On the number of bins in equilibria for signaling games 

      Sarıtaş, Serkan; Yüksel, Serdar; Gezici, Sinan (IEEE, 2019-07)
      We investigate the equilibrium behavior for the decentralized quadratic cheap talk problem in which an encoder and a decoder, viewed as two decision makers, have misaligned objective functions. In prior work, we have shown ...