3020 search results - page 12 / 604 » Optimal partition trees |
68
Voted
DAM
2007
14 years 11 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
84
Voted
GD
2004
Springer
15 years 5 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
101
click to vote
ICISC
2004
15 years 1 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
104
Voted
ICIP
1999
IEEE
16 years 1 months ago
1999
IEEE
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees c...
115
Voted
ICDE
2007
IEEE
15 years 3 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...