455 search results - page 45 / 91 » On Trees and Noncrossing Partitions |
JCT
2008
14 years 11 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
73
Voted
DCC
2000
IEEE
15 years 3 months ago
2000
IEEE
We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of...
ICWS
2010
IEEE
15 years 17 days ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
75
Voted
KDD
2004
ACM
15 years 11 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
ICISC
2004
15 years 15 days 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...