Results 1  10
of
505,028
The SettoSet DisjointPath Problem in Perfect Hierarchical Hypercubes
, 2011
"... The perfect hierarchical hypercube (HHC) interconnection network has been introduced in the literature recently. An HHC can connect many nodes while retaining a low degree and a small diameter. It is thus a suitable topology for interconnection networks of massively parallel systems. We describe in ..."
Abstract
 Add to MetaCart
in this paper an algorithm solving the settoset disjointpath routing problem in perfect HHCs. In an HHC2m+m, given two sets of m+1 nodes S and D, the proposed algorithm can find m+1 nodedisjoint paths between the nodes of S and the nodes of D of lengths at most (m+1)(2m+m+4)+3 in O(m222m) time complexity.
NodetoSet and SettoSet Cluster Fault Tolerant Routing in Hypercubes
 in Hypercubes. Parallel Computing
, 1998
"... : We study nodetoset and settoset fault tolerant routing problems in ndimensional hypercubes H n . Nodetoset routing problem is that given a node s and a set of nodes T = ft 1 ; :::; t k g, finds k nodedisjoint paths s ! t i , 1 i k. Settoset routing problem is that given two sets of nod ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
: We study nodetoset and settoset fault tolerant routing problems in ndimensional hypercubes H n . Nodetoset routing problem is that given a node s and a set of nodes T = ft 1 ; :::; t k g, finds k nodedisjoint paths s ! t i , 1 i k. Settoset routing problem is that given two sets
An Optimal Construction of NodeDisjoint Shortest Paths in
"... Routing functions had been shown effective in constructing nodedisjoint paths in hypercubelike networks. In this paper, by the aid of routing functions, m nodedisjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an ndimensional h ..."
Abstract
 Add to MetaCart
Routing functions had been shown effective in constructing nodedisjoint paths in hypercubelike networks. In this paper, by the aid of routing functions, m nodedisjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an n
SettoSet Disjoint Paths Routing in Hierarchical Cubic Networks
, 2012
"... Due to its simplicity, the hypercube topology is popular as interconnection network of parallel systems. However, due to physical restrictions of the number of links per node, this topology is no more satisfactory in the context of modern supercomputing. Effectively, today massively parallel systems ..."
Abstract
 Add to MetaCart
almost half of the number of edges of an hypercube of the same size, and additionally, its diameter is also smaller. We describe in this paper a settoset disjoint paths routing algorithm in an HCN(n), finding between two disjoint sets of nodes at most n + 1 mutually nodedisjoint paths of lengths
NodetoSet Vertex Disjoint Paths in Hypercube Networks
"... Design features for an efficient interconnection topology include properties like low degree, regularity, small diameter, high connectivity, efficient routing algorithms, high faulttolerance, low fault diameter etc. ..."
Abstract
 Add to MetaCart
Design features for an efficient interconnection topology include properties like low degree, regularity, small diameter, high connectivity, efficient routing algorithms, high faulttolerance, low fault diameter etc.
NodetoSet Vertex Disjoint Paths in Hypercube Networks
, 1998
"... this paper is to design a simple algorithm to compute such paths in Qn ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this paper is to design a simple algorithm to compute such paths in Qn
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 545 (1 self)
 Add to MetaCart
to materializing the data cube. In this paper, we investigate the issue of which cells (views) to materialize when it is too expensive to materialize all views. A lattice framework is used to express dependencies among views. We present greedy algorithms that work off this lattice and determine a good set of views
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 817 (67 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Results 1  10
of
505,028