Sciweavers

198 search results - page 24 / 40
» A New Approach to Abstract Syntax Involving Binders
Sort
View
JLP
2007
74views more  JLP 2007»
13 years 7 months ago
Linearity and bisimulation
Exploiting linear type structure, we introduce a new theory bisimilarity for the π-calculus in which we abstract away not only τ-actions but also non-τ actions which do not aff...
Nobuko Yoshida, Kohei Honda, Martin Berger
COMMA
2008
13 years 9 months ago
Semantics for Evidence-Based Argumentation
Abstract. The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the...
Nir Oren, Timothy J. Norman
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
EMSOFT
2003
Springer
14 years 23 days ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
TASLP
2008
149views more  TASLP 2008»
13 years 7 months ago
Using Articulatory Representations to Detect Segmental Errors in Nonnative Pronunciation
Abstract--Motivated by potential applications in second-language pedagogy, we present a novel approach to using articulatory information to improve automatic detection of typical p...
Joseph Tepperman, Shrikanth Narayanan