3888 search results - page 678 / 778 » Change-Driven Model Transformations |
114
click to vote
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
139
click to vote
UML
2005
Springer
15 years 9 months ago
2005
Springer
Design patterns embody proven solutions to recurring design problems. Ever since the gang of four popularized the concept, researchers have been trying to develop methods for repre...
138
click to vote
WAIM
2005
Springer
15 years 9 months ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
125
click to vote
WEBI
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
152
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
The Minimax Probability Machine (MPM) constructs a classifier, which provides a worst-case bound on the probability of misclassification of future data points based on reliable ...