Sciweavers

960 search results - page 104 / 192
» Computational Semantics Of Mass Terms
Sort
View
FOSSACS
2004
Springer
14 years 1 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
LREC
2008
155views Education» more  LREC 2008»
13 years 9 months ago
Mapping Roget's Thesaurus and WordNet to French
Roget's Thesaurus and WordNet are very widely used lexical reference works. We describe an automatic mapping procedure that effectively produces French translations of the te...
Gerard de Melo, Gerhard Weikum
IJFCS
2007
93views more  IJFCS 2007»
13 years 7 months ago
Modelling and Analysis of PKI-Based Systems Using Process Calculi
In this technical report, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retriev...
Benjamin Aziz, Geoff Hamilton
MM
2010
ACM
182views Multimedia» more  MM 2010»
13 years 8 months ago
Joke-o-Mat HD: browsing sitcoms with human derived transcripts
Joke-o-mat HD is a system that allows a user to navigate sitcoms (such as Seinfeld) by "narrative themes", including scenes, punchlines, and dialog segments. The themes ...
Adam Janin, Luke R. Gottlieb, Gerald Friedland
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...