455 search results - page 17 / 91 » On Trees and Noncrossing Partitions |
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...
ARSCOM
2007
13 years 7 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
JGT
2006
13 years 7 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
In this paper, an original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference po...
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...