Sciweavers

1826 search results - page 60 / 366
» Using Random Forests in the Structured Language Model
Sort
View
ECEASST
2008
69views more  ECEASST 2008»
13 years 8 months ago
Verifying Model Transformations by Structural Correspondence
: Model transformations play a significant role in model based software development, and the correctness of the transformation is crucial to the success of the development effort. ...
Anantha Narayanan, Gabor Karsai
IEE
2008
115views more  IEE 2008»
13 years 8 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
PAMI
2008
119views more  PAMI 2008»
13 years 8 months ago
Triplet Markov Fields for the Classification of Complex Structure Data
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...
Juliette Blanchet, Florence Forbes
FM
2006
Springer
111views Formal Methods» more  FM 2006»
14 years 11 days ago
A Formal Template Language Enabling Metaproof
Design patterns are usually described in terms of instances. Templates describe sentences of some language with a particular form, generate sentences upon instantiation, and can be...
Nuno Amálio, Susan Stepney, Fiona Polack
EMNLP
2009
13 years 6 months ago
An Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing
This paper describes an empirical study of high-performance dependency parsers based on a semi-supervised learning approach. We describe an extension of semisupervised structured ...
Jun Suzuki, Hideki Isozaki, Xavier Carreras, Micha...