• Conference Object  

      Bounds on the probability of misclassification among hidden Markov models 

      Keroglou, C.; Hadjicostis, Christoforos N. (2011)
      Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...
    • Article  

      Optimal merging algorithms for lossless codes with generalized criteria 

      Charalambous, T.; Charalambous, Charalambos D.; Rezaei, F. (2014)
      This paper presents lossless prefix codes optimized with respect to a payoff criterion consisting of a convex combination of maximum codeword length and average codeword length. The optimal codeword lengths obtained are ...
    • Conference Object  

      A scalable hash-based mobile agent location mechanism 

      Kastidou, G.; Pitoura, Evaggelia 1967-; Samaras, George S. (Institute of Electrical and Electronics Engineers Inc., 2003)
      In this paper, we propose a novel mobile agent tracking mechanism based on hashing. To allow our system to adapt to variable workloads, dynamic rehashing is supported The proposed mechanism scales well with both the number ...
    • Conference Object  

      Social networking of the smart home 

      Kamilaris, Andreas; Pitsillides, Andreas (2010)
      Social networking on the Web has become an integral part of our lives. Merging of computing with physical things enabled the conversion of everyday objects into information appliances. This merging allows Smart Homes to ...