Sciweavers

391 search results - page 59 / 79
» Compositionality for Probabilistic Automata
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Learning Mixtures of Offline and Online features for Handwritten Stroke Recognition
In this paper we propose a novel scheme to combine offline and online features of handwritten strokes. The stateof-the-art methods in handwritten stroke recognition have used a pr...
C. V. Jawahar, Karteek Alahari, Satya Lahari Putre...
JMLR
2010
137views more  JMLR 2010»
13 years 2 months ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel
FOSSACS
2011
Springer
12 years 11 months ago
Similarity Quotients as Final Coalgebras
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
Paul Blain Levy
ASWEC
2006
IEEE
14 years 1 months ago
A Runtime Monitoring and Validation Framework for Web Service Interactions
Web services are designed for composition and use by third parties through dynamic discovery. As such, the issue of interoperability between services is of great importance to ens...
Zheng Li, Yan Jin, Jun Han
CASCON
2007
110views Education» more  CASCON 2007»
13 years 9 months ago
Runtime monitoring of web service conversations
For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. In contrast, Web services a...
Yuan Gan, Marsha Chechik, Shiva Nejati, Jon Bennet...