Sciweavers

1419 search results - page 34 / 284
» Notes on Formalizing Context
Sort
View
JMLR
2010
134views more  JMLR 2010»
14 years 7 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
CONTEXT
2007
Springer
15 years 6 months ago
Context-Oriented Domain Analysis
Context-aware systems are software systems which adapt their behaviour according to the context of use. The requirements engineering phase is recognized as a primordial step to dev...
Brecht Desmet, Jorge Vallejos, Pascal Costanza, Wo...
104
Voted
ACL
2010
14 years 10 months ago
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
Benoît Sagot, Giorgio Satta
110
Voted
CIA
2007
Springer
15 years 6 months ago
Formal Analysis of Trust Dynamics in Human and Software Agent Experiments
Recognizing that trust states are mental states, this paper presents a formal analysis of the dynamics of trust in terms of the functional roles and representation relations for tr...
Tibor Bosse, Catholijn M. Jonker, Jan Treur, Dmytr...
123
Voted
DEXA
2005
Springer
109views Database» more  DEXA 2005»
15 years 6 months ago
Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
Marko Smiljanic, Maurice van Keulen, Willem Jonker