Sciweavers

432 search results - page 52 / 87
» On Notions of Regularity for Data Languages
Sort
View
POPL
1997
ACM
13 years 12 months ago
Behavioral Equivalence in the Polymorphic Pi-calculus
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
Benjamin C. Pierce, Davide Sangiorgi
CICLING
2009
Springer
13 years 8 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
LICS
2005
IEEE
14 years 1 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
NAACL
2010
13 years 5 months ago
Subword Variation in Text Message Classification
For millions of people in less resourced regions of the world, text messages (SMS) provide the only regular contact with their doctor. Classifying messages by medical labels suppo...
Robert Munro, Christopher D. Manning
VL
2009
IEEE
150views Visual Languages» more  VL 2009»
14 years 2 months ago
Discovery-based edit assistance for spreadsheets
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...
Jácome Cunha, João Saraiva, Joost Vi...