Sciweavers

1217 search results - page 121 / 244
» On compressing frequent patterns
Sort
View
138
Voted
ICSM
2005
IEEE
15 years 9 months ago
Design Pattern Mining Enhanced by Machine Learning
Design patterns present good solutions to frequently occurring problems in object-oriented software design. Thus their correct application in a system’s design may significantl...
Rudolf Ferenc, Árpád Beszédes...
ISNN
2007
Springer
15 years 10 months ago
Two-Dimensional Bayesian Subspace Analysis for Face Recognition
Bayesian subspace analysis (BSA) has been successfully applied in data mining and pattern recognition. However, due to the use of probabilistic measure of similarity, it often need...
Daoqiang Zhang
MASCOTS
2010
15 years 5 months ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
IS
2008
15 years 4 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
KES
2005
Springer
15 years 9 months ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura