Sciweavers

674 search results - page 32 / 135
» Arguments and Results
Sort
View
SBMF
2009
Springer
14 years 2 months ago
Corecursive Algebras: A Study of General Structured Corecursion
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because...
Venanzio Capretta, Tarmo Uustalu, Varmo Vene
ICML
2006
IEEE
14 years 8 months ago
On Bayesian bounds
We show that several important Bayesian bounds studied in machine learning, both in the batch as well as the online setting, arise by an application of a simple compression lemma....
Arindam Banerjee
ACL
2007
13 years 9 months ago
Ordering Phrases with Function Words
This paper presents a Function Word centered, Syntax-based (FWS) solution to address phrase ordering in the context of statistical machine translation (SMT). Motivated by the obse...
Hendra Setiawan, Min-Yen Kan, Haizhou Li
AIMSA
2006
Springer
13 years 11 months ago
A Formal General Setting for Dialogue Protocols
Abstract. In this paper, we propose a general and abstract formal setting for argumentative dialogue protocols. We identify a minimal set of basic parameters that characterize dial...
Leila Amgoud, Sihem Belabbes, Henri Prade
ENTCS
2007
101views more  ENTCS 2007»
13 years 7 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...