653 search results - page 52 / 131 » The size of minimum 3-trees |
ICPR
2006
IEEE
16 years 28 days ago
2006
IEEE
We propose an alternative to probability density classifiers based on normal distributions LDA and QDA. Instead of estimating covariance matrices using the standard maximum likeli...
FCT
2009
Springer
15 years 6 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature ...
ERCIMDL
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...