<?xml version="1.0" ?>
<!-- This file was exported from BibSonomy, http://www.bibsonomy.org -->

<bibliography>

<biblioentry xreflabel="Bertocchi1995" id="Bertocchi1995">
   <authorgroup>
       <author><firstname>Graziella</firstname><surname>Bertocchi</surname></author>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Efficiency and optimality in stochastic models with production</citetitle>
   <citetitle pubwork="journal">Journal of Economic Dynamics and Control</citetitle>

   <volumenum>19</volumenum> 

   <artpagenums>303&#x2013;325</artpagenums> 
   <pubdate>1995</pubdate>  

</biblioentry>
<biblioentry xreflabel="series/sci/Kehagias07" id="series/sci/Kehagias07">
   <authorgroup>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Family of Multi&#45;valued t&#45;norms and t&#45;conorms.</citetitle>

   <publisher>
      <publishername>Springer</publishername>
   </publisher>
   <volumenum>67</volumenum> 

   <artpagenums>341-360</artpagenums> 
   <pubdate>2007</pubdate>  

</biblioentry>
<biblioentry xreflabel="series/sci/Kehagias07a" id="series/sci/Kehagias07a">
   <authorgroup>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">The Construction of Fuzzy&#45;valued t&#45;norms and t&#45;conorms.</citetitle>

   <publisher>
      <publishername>Springer</publishername>
   </publisher>
   <volumenum>67</volumenum> 

   <artpagenums>361-370</artpagenums> 
   <pubdate>2007</pubdate>  

</biblioentry>
<biblioentry xreflabel="kehagias:bf" id="kehagias:bf">
   <authorgroup>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Stochastic Recurrent Networks Training by the Local Backward&#45;Forward Algorithm</citetitle>





   <pubdate>1991</pubdate>  

</biblioentry>
<biblioentry xreflabel="kehagias:bf" id="kehagias:bf">
   <authorgroup>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Stochastic Recurrent Networks Training by the Local Backward&#45;Forward Algorithm</citetitle>





   <pubdate>1991</pubdate>  

</biblioentry>
<biblioentry xreflabel="kehagias:stochastic" id="kehagias:stochastic">
   <authorgroup>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Stochastic Recurrent Networks: Prediction and Classification of Time Series</citetitle>





   <pubdate>1991</pubdate>  

</biblioentry>
<biblioentry xreflabel="kehagias:temporal" id="kehagias:temporal">
   <authorgroup>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Short Bibliography of Connectionist Systems for Temporal Behavior</citetitle>





   <pubdate>1991</pubdate>  

</biblioentry>
<biblioentry xreflabel="1995" id="1995">
   <authorgroup>
       <author><firstname>Hans</firstname><surname>Kunsch</surname></author>
       <author><firstname>Stuart</firstname><surname>Geman</surname></author>
       <author><firstname>Athanasios</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Hidden Markov Random Fields</citetitle>
   <citetitle pubwork="journal">The Annals of Applied Probability</citetitle>
   <publisher>
      <publishername>Institute of Mathematical Statistics</publishername>
   </publisher>
   <volumenum>5</volumenum> 

   <artpagenums>577&#x2013;602</artpagenums> 
   <pubdate>1995</pubdate>  
   <abstract>
      <para>A noninvertible function of a first&#45;order Markov process or of a nearest&#45;neighbor Markov random field is called a hidden Markov model. Hidden Markov models are generally not Markovian. In fact&#44; they may have complex and long range interactions&#44; which is largely the reason for their utility. Applications include signal and image processing&#44; speech recognition and biological modeling. We show that hidden Markov models are dense among essentially all finite&#45;state discrete&#45;time stationary processes and finite&#45;state lattice&#45;based stationary random fields. This leads to a nearly universal parameterization of stationary processes and stationary random fields&#44; and to a consistent nonparametric estimator. We show the results of attempts to fit simple speech and texture patterns.
      </para>
   </abstract>
</biblioentry>
<biblioentry xreflabel="journals/isca/MamalisKP08" id="journals/isca/MamalisKP08">
   <authorgroup>
       <author><firstname>Basilis</firstname><surname>Mamalis</surname></author>
       <author><firstname>Dimitris</firstname><surname>Kehagias</surname></author>
       <author><firstname>Grammati</firstname><othername role="mi">E.</othername><surname>Pantziou</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Efficient Techniques for Parallel Text Retrieval on PC&#45;Cluster Environments.</citetitle>
   <citetitle pubwork="journal">I. J. Comput. Appl.</citetitle>

   <volumenum>15</volumenum> 

   <artpagenums>27-42</artpagenums> 
   <pubdate>2008</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/jcsc/VoyiatzisK06" id="journals/jcsc/VoyiatzisK06">
   <authorgroup>
       <author><firstname>Ioannis</firstname><surname>Voyiatzis</surname></author>
       <author><firstname>D.</firstname><surname>Kehagias</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A SiC Pair Generator for a Bilbo Environment.</citetitle>
   <citetitle pubwork="journal">Journal of Circuits&#44; Systems&#44; and Computers</citetitle>

   <volumenum>15</volumenum> 

   <artpagenums>739-756</artpagenums> 
   <pubdate>2006</pubdate>  

</biblioentry>
</bibliography>
