Sciweavers

2916 search results - page 115 / 584
» Generating Rule Sets from Model Trees
Sort
View
WOSP
2005
ACM
15 years 9 months ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
ICNC
2005
Springer
15 years 9 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
INFORMATICALT
2008
122views more  INFORMATICALT 2008»
15 years 3 months ago
Modeling Phone Duration of Lithuanian by Classification and Regression Trees, using Very Large Speech Corpus
Classification and regression tree approach was used in this research to model phone duration of Lithuanian. 300 thousand samples of vowels and 400 thousand samples of consonants e...
Giedrius Norkevicius, Gailius Raskinis
CINQ
2004
Springer
151views Database» more  CINQ 2004»
15 years 7 months ago
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very diffe...
Marco Botta, Jean-François Boulicaut, Cyril...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 5 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák