Sciweavers

838 search results - page 75 / 168
» From Natural Language to Formal Proof Goal
Sort
View
PLDI
2012
ACM
13 years 8 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
LREC
2010
191views Education» more  LREC 2010»
15 years 7 months ago
The SignSpeak Project - Bridging the Gap Between Signers and Speakers
The SignSpeak project will be the first step to approach sign language recognition and translation at a scientific level already reached in similar research fields such as automat...
Philippe Dreuw, Hermann Ney, Gregorio Martinez, On...
COLING
2000
15 years 7 months ago
Language Identification In Unknown Signals
This paper describes algorithms and software developed to characterise and detect generic intelligent language-like features iu an input signal, using Natural Language Learning te...
John R. Elliott, Eric Atwell, Bill Whyte
TCS
2008
15 years 6 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ESOP
2010
Springer
16 years 1 months ago
A Universal Calculus for Stream Processing Languages
Stream processing applications such as algorithmic trading, MPEG processing, and web content analysis are ubiquitous and essential to business and entertainment. Language designers...
Robert Soulé, Martin Hirzel, Robert Grimm, ...