Sciweavers

5227 search results - page 705 / 1046
» Enterprise modeling using class and instance models
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 6 months ago
Bootstrapping Deep Lexical Resources: Resources for Courses
We propose a range of deep lexical acquisition methods which make use of morphological, syntactic and ontological language resources to model word similarity and bootstrap from a ...
Timothy Baldwin
JPDC
2006
106views more  JPDC 2006»
15 years 6 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
ENTCS
2007
133views more  ENTCS 2007»
15 years 6 months ago
Modelchecking Correctness of Refactorings - Some Experiments
Refactorings are changes made to programs, models or specifications with the intention of improving their structure and thus making them clearer, more readable and re-usable. Ref...
H.-Christian Estler, Thomas Ruhroth, Heike Wehrhei...
ACL
2010
15 years 4 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