3229 search results - page 297 / 646 » The Theory of Timed Automata |
199
click to vote
ACL
2010
15 years 4 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
208
click to vote
DAM
2011
15 years 1 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
160
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we present a case study of humaninformation interaction in the online realm of politics. The case study consists of a participant observed while searching and brows...
188
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
187
click to vote
QEST
2006
IEEE
16 years 24 days ago
2006
IEEE
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...