3020 search results - page 18 / 604 » Optimal partition trees |
DAM
1998
14 years 11 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
CSCWD
2008
Springer
15 years 1 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
SAMT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract—This paper presents an annotation tool for the manual and region-based annotation of still images. The selection of regions is achieved by navigating through a Partition...
141
click to vote
JDCTA
2010
14 years 6 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...