Balanced bipartitioning of a multi-weighted hypergraph for heterogeneous FPGAS

2011 ◽  
Author(s):  
Sagnik Mukhopadhyay ◽  
Pritha Banerjee ◽  
Susmita Sur-Kolay
Keyword(s):  
Weighted Hypergraph

Fragment Re-Allocation Strategy Based on Hypergraph for NoSQL Database Systems

2016 ◽  
Vol 8 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Zhikun Chen ◽  
Shuqiang Yang ◽  
Yunfei Shang ◽  
Yong Liu ◽  
Feng Wang ◽  
...  
Keyword(s):  
Database Systems ◽  
Communication Cost ◽  
Allocation Strategy ◽  
Hypergraph Partitioning ◽  
Computing Model ◽  
Operation Pattern ◽  
Nosql Database ◽  
High Scalability ◽  
Weighted Hypergraph ◽  
Allocation Strategies

NoSQL database is famed for the characteristics of high scalability, high availability, and high fault-tolerance. It is used to manage data for a lot of applications. The computing model has been transferred to “computing close to data”. Therefore, the location of fragment directly affects system's performance. Every site's load dynamical changes because of the increasing data and the ever-changing operation pattern. So system has to re-allocate fragment to improve system's performance. The general fragment re-allocation strategies of NoSQL database scatter the related fragments as possible to improve the operations' parallel degree. But those fragments may interact with each other in some application's operations. So the high parallel degree of operation may increase system's communication cost such as data are transferred by network. In this paper, the authors propose a fragment re-allocation strategy based on hypergraph. This strategy uses a weighted hypergraph to represent the fragments' access pattern of operations. A hypergraph partitioning algorithm is used to cluster fragments in the strategy. This strategy can improve system's performance according to reducing the communication cost while guaranteeing the parallel degree of operations. Experimental results confirm that the strategy will effectively contribute in solving fragment re-allocation problem in specific application environment of NoSQL database system, and it can improve system's performance.

scholarly journals A local search algorithm for the constrained max cut problem on hypergraphs.

2018 ◽  
Author(s):  
Nasim Samei ◽  
Roberto Solis-Oba
Keyword(s):  
Local Search ◽  
Search Algorithm ◽  
Approximation Ratio ◽  
Local Search Algorithm ◽  
Multiway Cut ◽  
Max Cut Problem ◽  
Weighted Hypergraph

In the constrained max k-cut problem on hypergraphs, we are given a weighted hypergraph H=(V, E), an integer k and a set c of constraints. The goal is to divide the set V of vertices into k disjoint partitions in such a way that the sum of the weights of the hyperedges having at least two endpoints in different partitions is maximized and the partitions satisfy all the constraints in c. In this paper we present a local search algorithm for the constrained max k-cut problem on hypergraphs and show that it has approximation ratio 1-1/k for a variety of constraints c, such as for the constraints defining the max Steiner k-cut problem, the max multiway cut problem and the max k-cut problem. We also show that our local search algorithm can be used on the max k-cut problem with given sizes of parts and on the capacitated max k-cut problem, and has approximation ratio 1-|Vmax|/|V|, where |Vmax| is the cardinality of the biggest partition. In addition, we present a local search algorithm for the directed max k-cut problem that has approximation ratio (k-1)/(3k-2).

scholarly journals A local search algorithm for the constrained max cut problem on hypergraphs.

2018 ◽  
Author(s):  
Nasim Samei ◽  
Roberto Solis-Oba
Keyword(s):  
Local Search ◽  
Search Algorithm ◽  
Approximation Ratio ◽  
Local Search Algorithm ◽  
Multiway Cut ◽  
Max Cut Problem ◽  
Weighted Hypergraph

In the constrained max k-cut problem on hypergraphs, we are given a weighted hypergraph H=(V, E), an integer k and a set c of constraints. The goal is to divide the set V of vertices into k disjoint partitions in such a way that the sum of the weights of the hyperedges having at least two endpoints in different partitions is maximized and the partitions satisfy all the constraints in c. In this paper we present a local search algorithm for the constrained max k-cut problem on hypergraphs and show that it has approximation ratio 1-1/k for a variety of constraints c, such as for the constraints defining the max Steiner k-cut problem, the max multiway cut problem and the max k-cut problem. We also show that our local search algorithm can be used on the max k-cut problem with given sizes of parts and on the capacitated max k-cut problem, and has approximation ratio 1-|Vmax|/|V|, where |Vmax| is the cardinality of the biggest partition. In addition, we present a local search algorithm for the directed max k-cut problem that has approximation ratio (k-1)/(3k-2).

Semantic embedding for indoor scene recognition by weighted hypergraph learning

2015 ◽  
Vol 112 ◽  
pp. 129-136 ◽  
Author(s):  
Jun Yu ◽  
Chaoqun Hong ◽  
Dapeng Tao ◽  
Meng Wang
Keyword(s):  
Scene Recognition ◽  
Semantic Embedding ◽  
Indoor Scene ◽  
Hypergraph Learning ◽  
Weighted Hypergraph

scholarly journals Salient Object Detection Based on Weighted Hypergraph and Random Walk

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
WeiYi Wei ◽  
Hui Chen
Keyword(s):  
Random Walk ◽  
Object Detection ◽  
Clustering Algorithm ◽  
Graph Model ◽  
Input Image ◽  
Salient Object Detection ◽  
Salient Object ◽  
Hypergraph Model ◽  
Benchmark Datasets ◽  
Weighted Hypergraph

Recently, salient object detection based on the graph model has attracted extensive research interest in computer vision because the graph model can represent the relationship between two regions better. However, it is difficult to capture the high-level relationship between multiple regions. In this algorithm, the input image is segmented into superpixels first. Then, a weighted hypergraph model is established using fuzzy C-means clustering algorithm and a new weighting strategy. Finally, the random walk algorithm is used to sort all superpixels on the weighted hypergraph model to obtain the salient object. The experimental results on three benchmark datasets demonstrate that the proposed method performs better than some other state-of-the-art methods.

scholarly journals Quantum blockchain using weighted hypergraph states

2020 ◽  
Vol 2 (1) ◽  
Author(s):  
Shreya Banerjee ◽  
Arghya Mukherjee ◽  
Prasanta K. Panigrahi
Keyword(s):  
Weighted Hypergraph
Sign in / Sign up

Export Citation Format

Share Document