Sciweavers

7393 search results - page 576 / 1479
» Synthesis-for-testability using transformations
Sort
View
ICMT
2009
Springer
16 years 2 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
CISS
2008
IEEE
16 years 1 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
PVLDB
2008
107views more  PVLDB 2008»
15 years 7 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
FASE
2004
Springer
16 years 25 days ago
Consistent Adaptation and Evolution of Class Diagrams during Refinement
Abstract. Software models are key in separating and solving independent development concerns. However, there is still a gap on how to transition design information among these sepa...
Alexander Egyed
CVPR
2009
IEEE
17 years 2 months ago
Learning Shape Prior Models for Object Matching
The aim of this work is to learn a shape prior model for an object class and to improve shape matching with the learned shape prior. Given images of example instances, we can le...
Cordelia Schmid, Frédéric Jurie, Tin...