Results 1  10
of
299,967
On Uniform kPartition Problems
"... We study various uniform kpartition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems di#er according to the particular measure of "set uniformity ..."
Abstract
 Add to MetaCart
We study various uniform kpartition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems di#er according to the particular measure of "
K–partitioning of Signed or Weighted Bipartite Graphs
"... Abstract — In this work, Kpartitioning of signed or weighted bipartite graph problem has been introduced, which appears as a real life problem where the partitions of bipartite graph represent two different entities and the edges between the nodes of the partitions represent the relationships among ..."
Abstract
 Add to MetaCart
Abstract — In this work, Kpartitioning of signed or weighted bipartite graph problem has been introduced, which appears as a real life problem where the partitions of bipartite graph represent two different entities and the edges between the nodes of the partitions represent the relationships
Cliques in kpartite Graphs and their Application in Textile Engineering
"... In many practical cases one has to choose an arrangement of different so that they are compatible. Whenever the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In many practical cases one has to choose an arrangement of different so that they are compatible. Whenever the
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and kPartite Graphs
, 2013
"... Consider the following problem. A seller has infinite copies of n products represented by nodes in a graph. There are m consumers, each has a budget and wants to buy two products. Consumers are represented by weighted edges. Given the prices of products, each consumer will buy both products she wa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
on special classes of graphs. In this paper, we study this problem on a large class of graphs such as graphs with bounded treewidth, bounded genus and kpartite graphs. We show that there exists an FPTAS for GVP on graphs with bounded treewidth. This result is also extended to an FPTAS for the more general
Pack: Scalable parameterfree clustering on kpartite graphs
 In SDM Work. on Link Anal., Cntr.terror. and Secur
, 2009
"... Given an authorpaperconference graph, how can we automatically find groups for author, paper and conference respectively. Existing work either (1) requires fine tuning of several parameters, or (2) can only be applied to bipartite graphs (e.g., authorpaper graph, or paperconference graph). To ad ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
). To address this problem, in this paper, we propose PaCK for clustering such kpartite graphs. By optimizing an informationtheoretic criterion, PaCK searches for the best number of clusters for each type of object and generates the corresponding clustering. The unique feature of PaCK over existing methods
Randomized WorkCompetitive Scheduling for Cooperative Computing on kpartite Task Graphs
, 805
"... A fundamental problem in distributed computing is the task of cooperatively executing a given set of t tasks by p processors where the communication medium is dynamic and subject to failures. The dynamics of the communication medium lead to groups of processors being disconnected and possibly reconn ..."
Abstract
 Add to MetaCart
generalization of this problem where the tasks have dependencies among them defined by a task dependency graph. In particular, we consider task dependency graphs that are kpartite task graphs. Such task dependency graphs have been studied extensively in performing dependency analysis of PRAM algorithms
FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in LookupTable Based FPGA Designs
 IEEE TRANS. CAD
, 1994
"... The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Bo ..."
Abstract

Cited by 317 (41 self)
 Add to MetaCart
The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Boolean networks and little is known about how far their solutions are away from the optimal ones. This paper presents a theoretical breakthrough which shows that the LUTbased FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time. A key step in our algorithm is to compute a minimum height Kfeasible cut in a network, which is solved optimally in polynomial time based on network flow computation. Our algorithm also effectively minimizes the number of LUTs by maximizing the volume of each cut and by several postprocessing operations. Based on these results, we have implemented an LUTbased FPGA mapping package called FlowMap. We have tested FlowMap on a large set of benchmark examples and compared it with other LUTbased FPGA mapping algorithms for delay optimization, including Chortled, MISpgadelay, and DAGMap. FlowMap reduces the LUT network depth by up to 7% and reduces the number of LUTs by up to 50% compared to the three previous methods.
Towards Community Detection in kPartite kUniform Hypergraphs
"... Recently, numerous applications have emerged that create data most naturally interpreted as kpartite kuniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a hy ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Recently, numerous applications have emerged that create data most naturally interpreted as kpartite kuniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a
Results 1  10
of
299,967