CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
ACL
1998
13 years 5 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
13 years 5 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
ICWS
2004
IEEE
13 years 6 months ago
2004
IEEE
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
STACS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
ICRA
2003
IEEE
13 years 9 months ago
2003
IEEE
We present an approach that uses Q-learning on individual robotic agents, for coordinating a missiontasked team of robots in a complex scenario. To reduce the size of the state sp...
IEEESCC
2005
IEEE
13 years 10 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...