2492 search results - page 23 / 499 » On the General Signature Trees |
CLUSTER
2009
IEEE
14 years 2 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
FLAIRS
2010
13 years 10 months ago
2010
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...