Sciweavers

1923 search results - page 105 / 385
» Weighted Decision Trees
Sort
View
DAM
2006
100views more  DAM 2006»
15 years 6 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
EMS
2008
IEEE
16 years 22 days ago
A Weighted Utility Framework for Mining Association Rules
Association rule mining (ARM) identifies frequent itemsets from databases and generates association rules by assuming that all items have the same significance and frequency of oc...
M. Sulaiman Khan, Maybin K. Muyeba, Frans Coenen
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
ICIP
2007
IEEE
15 years 10 months ago
H.263 to H.264 Transconding using Data Mining
1 In this paper, we propose the use of data mining algorithms to create a macroblock partition mode decision algorithm for inter-frame prediction, to be used as part of a high-effi...
Gerardo Fernández-Escribano, Jens Bialkowsk...
NLP
2000
15 years 9 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman