Sciweavers

1308 search results - page 36 / 262
» Let's Have a Conversation
Sort
View
PLANX
2007
15 years 15 days ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ICASSP
2011
IEEE
14 years 2 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney
EDOC
2007
IEEE
15 years 5 months ago
Implementing Business Conversations with Consistency Guarantees Using Message-Oriented Middleware
The paper considers distributed applications where interactions between constituent services take place via messages in an asynchronous environment with unpredictable communicatio...
Carlos Molina-Jiménez, Santosh K. Shrivasta...
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
15 years 5 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
ACOM
2006
Springer
15 years 5 months ago
Flexible Conversations Using Social Commitments and a Performatives Hierarchy
In this research, we re-arrange FIPA’s ACL performatives to form a subsumption lattice (ontology) and apply a theory of social commitments to achieve a simplified and observable...
Robert C. Kremer, Roberto A. Flores