MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Athanasios Kehagias" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 11 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Linear Text Segmentation using a Dynamic Programming Algorithm  
  • by Athanasios Kehagias — 2003 — In Proceedings of the EACL
  • …In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity and (b) prior information about segment length. The evaluation of the segmentation accuracy of t…
  • Cited by 5 (0 self) – Add To MetaCart
  • Stochastic Recurrent Networks: Prediction and Classification of Time Series  
  • by Athanasios Kehagias — 1997 — Division of Applied Mathematics, Brown
  • …We use Stochastic Recurrent Networks of the type introduced in [Keh91a] as models of finite-alphabet time series. We develop the Maximum Likelihood Prediction Algorithm and the Maximum A teriori Classification Algorithm (which can both be implemented in recurrent PDP form). The prediction proble…
  • Cited by 4 (1 self) – Add To MetaCart
  • Stochastic Recurrent Networks Training by the Local Backward-Forward Algorithm  
  • by Athanasios Kehagias — 1991 — Division of Applied Mathematics, Brown
  • …We introduce Stochastic Recurrent Networks, which are collections of interconnected finite state units. At every discrete time step, each unit goes into a new state, following a probability law that is conditional on the state of neighboring units at the previous time step. A network of this typ…
  • Cited by 3 (1 self) – Add To MetaCart
  • Approximation of Stochastic Processes by Hidden Markov Models  
  • by Athanasios Kehagias — 1998
  • …In this thesis we restrict ourselves to stationary and discrete valued stochastic processes. A pair of stochastic processes (X; Y) is a Hidden Markov Model (HMM) if X (the state process) is a Markov process and Y (the observable process) is an incomplete observation of X. The observation can be dete…
  • Cited by 1 (1 self) – Add To MetaCart
  • On the Refinement of Ontologies  
  • by Grigoris Antoniou, Athanasios Kehagias — 2000 — International Journal of Intelligent Systems
  • …. Ontologies have emerged as one of the key issues in information integration and interoperability and their application to knowledge management and electronic commerce. A trend towards formal methods for ontology management is obvious. This paper discusses a concept which can be expected to be of g…
  • Cited by 6 (0 self) – Add To MetaCart
  • Probabilistic strategies for pursuit in cluttered environments with multiple robots  
  • by Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Singh — 2007 — In Proc. Int’l Conf. on Robotics and Automation
  • …Abstract — In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to locate a non-adversarial mobile evader in an indoor environment. Unlike many other approaches to this problem, our method see…
  • Cited by 2 (1 self) – Add To MetaCart
  • Linear Text Segmentation using a Dynamic Programming Algorithm  
  • by Athanasios Kehagias Dept, Athanasios Kehagias, Comp Sciences, Fragkou Pavlina, Vassilios Petridis — 2003 — In Proceedings of the EACL
  • …In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity and (b) prior information about segment length. The evaluation of the segmentation accura…
  • Add To MetaCart
  • Optimal Control Interpretation  
  • by Of The Backward-Forward, Athanasios Kehagias — 1990
  • …The Backward-Forward algorithm is a highly efficient method for training Hidden Markov Mod- els. Its name derives (and its implementation depends) on two types of probabilities: the forward propagating a probabilities and the backward proagating/ probabilities. In this note we formulate the train…
  • Add To MetaCart
  • On the Refinement of Ontologies  
  • by Grigoris Antoniou And, Grigoris Antoniou, Athanasios Kehagias — 2000 — International Journal of Intelligent Systems
  • …Ontologies have emerged as one of the key issues in information integration and interoperability and their application to knowledge management and electronic commerce. A trend towards formal methods for ontology management is obvious. This paper discusses a concept which can be expected to be of…
  • Add To MetaCart
  • Journal of Intelligent Information Systems, 21:3, 227--247, 2003 c  
  • by Comparison Of Word-, Athanasios Kehagias, Vassilis G. Kaburlasos — 2003 — Journal of Intelligent Information Systems
  • …Most of the text categorization algorithms in the literature represent documents as collections of words. An alternative which has not been sufficiently explored is the use of word meanings, also known as senses. In this paper, using several algorithms, we compare the categorization accuracy of clas…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB