Now showing items 1-20 of 51

    • ACMICS: an agent communication model for interacting crowd simulation 

      Kullu, K.; Güdükbay, Uğur; Manocha, D. (Springer, 2017)
      Behavioral plausibility is one of the major aims of crowd simulation research. We present a novel approach that simulates communication between the agents and assess its influence on overall crowd behavior. Our formulation ...
    • Automatic detection of geospatial objects using multiple hierarchical segmentations 

      Akçay, H. G.; Aksoy, S. (Institute of Electrical and Electronics Engineers, 2008-07)
      The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods ...
    • Bilgi, bilim ve bilişim 

      Güvenç, Bozkurt (1991)
    • Bilgi-bilgi örgünlüğü ve sanat 

      Azaz, Yaşar (1991)
    • BilVideo: Design and implementation of a video database management system 

      Dönderler, M. E.; Şaykol, E.; Arslan, U.; Ulusoy, Özgür; Güdükbay, Uğur (Springer, 2005)
      With the advances in information technology, the amount of multimedia data captured, produced, and stored is increasing rapidly. As a consequence, multimedia content is widely used for many applications in today's world, ...
    • A bound on the zero-error list coding capacity 

      Arıkan, Erdal (IEEE, 1993)
      We present a new bound on the zero-error list coding capacity, and using which, show that the list-of-3 capacity of the 4/3 channel is at most 6/19 bits, improving the best previously known bound of 3/8. The relation of ...
    • Capacity region of multi-resolution streaming in peer-to-peer networks 

      Karagöz, B.; Yavuz, Semih; Ho, T.; Effros, M. (IEEE, 2013)
      We consider multi-resolution streaming in fully-connected peer-to-peer networks, where transmission rates are constrained by arbitrarily specified upload capacities of the source and peers. We fully characterize the capacity ...
    • Channel polarization: A method for constructing capacity-achieving codes 

      Arıkan, Erdal (IEEE, 2008-07)
      A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity I(W) is the ...
    • Code design for binary energy harvesting channel 

      Dabirnia, Mehdi; Duman, Tolga M. (IEEE, 2017)
      We consider a binary energy harvesting communication system with a finite battery transmitter over a noisy channel, and design explicit and implementable codes based on concatenation of a nonlinear trellis code (NLTC) with ...
    • Coding method for discrete noiseless channels with input constraints 

      Arıkan, Erdal (IEEE, 1988)
      Summary form only given. Two coding algorithms for discrete noiseless channels with input constraints have been analyzed. The first algorithm, which requires infinite-precision arithmetic and is mainly of theoretical ...
    • Deriving pairwise transfer entropy from network structure and motifs 

      Novelli, L.; Atay, Fatihcan M.; Jost, J.; Lizier, J. T. (Royal Society Publishing, 2020)
      Transfer entropy (TE) is an established method for quantifying directed statistical dependencies in neuroimaging and complex systems datasets. The pairwise (or bivariate) TE from a source to a target node in a network does ...
    • Dynamic signaling games under Nash and Stackelberg equilibria 

      Sarıtaş, Serkan; Yüksel, Serdar; Gezici, Sinan (IEEE, 2016)
      In this study, dynamic and repeated quadratic cheap talk and signaling game problems are investigated. These involve encoder and decoders with mismatched performance objectives, where the encoder has a bias term in the ...
    • Dynamic signaling games with quadratic criteria under Nash and Stackelberg equilibria 

      Sarıtaş, Serkan; Yüksel, Serdar; Gezici, Sinan (Elsevier, 2020-01)
      This paper considers dynamic (multi-stage) signaling games involving an encoder and a decoder who have subjective models on the cost functions. We consider both Nash (simultaneous-move) and Stackelberg (leader–follower) ...
    • Full-complex amplitude modulation with binary spatial light modulators 

      Ulusoy, E.; Onural, L.; Özaktaş, Haldun M. (Optical Society of America, 2011-10-19)
      Imperfections and nonrobust behavior of practical multilevel spatial light modulators (SLMs) degrade the performance of many proposed full-complex amplitude modulation schemes. We consider the use of more robust binary ...
    • Generalized approximate message-passing decoder for universal sparse superposition codes 

      Bıyık, Erdem; Barbier, J.; Dia, M. (IEEE, 2017-06)
      Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are ...
    • GenoGuard: protecting genomic data against brute-force attacks 

      Huang, Z.; Ayday, Erman; Fellay, Jacques; Hubaux, J-P.; Juels, A. (IEEE, 2015-05)
      Secure storage of genomic data is of great and increasing importance. The scientific community's improving ability to interpret individuals' genetic materials and the growing size of genetic database populations have been ...
    • Guessing subject to distortion 

      Arikan, E.; Merhav, N. (Institute of Electrical and Electronics Engineers, 1998-05)
      We investigate the problem of guessing a random vector X within distortion level D. Our aim is to characterize the best attainable performance in the sense of minimizing, in some probabilistic sense, the number of required ...
    • Guessing with lies 

      Arıkan, Erdal; Boztaş, S. (IEEE, 2002-06-07)
      A practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in ...
    • 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 inequality on guessing and its application to sequential decoding 

      Arikan, E. (Institute of Electrical and Electronics Engineers, 1996-01)
      Let (X,Y) be a pair of discrete random variables with X taking one of M possible values, Suppose the value of X is to be determined, given the value of Y, by asking questions of the form "Is X equal to x?" until the answer ...