455 search results - page 57 / 91 » On Trees and Noncrossing Partitions |
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
CEE
2006
13 years 8 months ago
2006
The expected number of transmissions is a very important parameter to evaluate the multicast performance. It is often used to estimate the bandwidth consumption of tree-based reli...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
APWEB
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a novel indexing technique called Multi-scale Similarity Indexing (MSI) to index image’s multi-features into a single one-dimensional structure. Both f...
TPDS
2008
13 years 7 months ago
2008
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...