Sciweavers

1750 search results - page 238 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
CIBSE
2008
ACM
14 years 12 months ago
Using Refinement Checking as System Testing
Abstract. Software testing is an expensive and time-consuming activity; it is also error-prone due to human factors. But, it still is the most common effort used in the software in...
Cristiano Bertolini, Alexandre Mota
AI
2004
Springer
14 years 9 months ago
A unifying semantics for time and events
We give a formal semantics for a highly expressive language for representing temporal relationships and events. This language, which we call Versatile Event Logic (VEL), provides ...
Brandon Bennett, Antony Galton
IANDC
2000
64views more  IANDC 2000»
14 years 9 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
JMLR
2012
13 years 12 days ago
Joint Learning of Words and Meaning Representations for Open-Text Semantic Parsing
Open-text semantic parsers are designed to interpret any statement in natural language by inferring a corresponding meaning representation (MR – a formal representation of its s...
Antoine Bordes, Xavier Glorot, Jason Weston, Yoshu...
ASIAN
2003
Springer
111views Algorithms» more  ASIAN 2003»
15 years 3 months ago
Unreliable Failure Detectors via Operational Semantics
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
Uwe Nestmann, Rachele Fuzzati