263 search results - page 51 / 53 » Minimum Entropy Coloring |
166
Voted
DATAMINE
1999
15 years 3 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
162
Voted
TMM
2010
14 years 10 months ago
2010
Previous video summarization studies focused on monocular videos, and the results would not be good if they were applied to multi-view videos directly, due to problems such as the ...
137
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
142
Voted
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
148
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....