3020 search results - page 352 / 604 » Optimal partition trees |
136
click to vote
ESA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
167
Voted
CIVR
2005
Springer
16 years 4 days ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
155
Voted
MLDM
2005
Springer
16 years 3 days ago
2005
Springer
In supervised machine learning, the partitioning of the values (also called grouping) of a categorical attribute aims at constructing a new synthetic attribute which keeps the info...
170
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
—A unified approach to rate-distortion (R-D) optimized compression and view-dependent transmission of three-dimensional (3-D) normal meshes is investigated in this work. A norma...
184
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...