Sciweavers

10285 search results - page 77 / 2057
» Composing Feature Models
Sort
View
109
Voted
TCC
2010
Springer
133views Cryptology» more  TCC 2010»
15 years 14 days ago
On the Necessary and Sufficient Assumptions for UC Computation
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
118
Voted
ECBS
2003
IEEE
115views Hardware» more  ECBS 2003»
15 years 8 months ago
Details of Formalized Relations in Feature Models Using OCL
System families are a form of high level reuse of development assets in a specific problem domain, by making use of commonalities and variabilities. To represent assets belonging ...
Detlef Streitferdt, Matthias Riebisch, Ilka Philip...
143
Voted
ICDAR
2011
IEEE
14 years 2 months ago
A Generative Model for Handwritings Based on Enhanced Feature Desynchronization
—A new generative model of handwriting patterns is proposed for interpreting their deformations. The model is based on feature desynchronization, which is a coupling process of
Seiichi Uchida, Toru Sasaki, Yaokai Feng
110
Voted
ITS
1992
Springer
123views Multimedia» more  ITS 1992»
15 years 6 months ago
Evaluation of Feature Based Modelling in Subtraction
One aim of intelligent tutoring systems is to tailor lessons to each individual student's needs. To do this a tutoring system requires a model of the student's knowledge...
Mark Kuzmycz, Geoffrey I. Webb
132
Voted
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 6 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber