Filters








48 Hits in 3.9 sec

Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization

Matthias Stallmann, Franc Brglez, Debabrata Ghosh
2001 ACM Journal of Experimental Algorithmics  
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = (V 0 , V 1 , E) along two parallel lines so that edge crossings are minimized, has application to circuit layout and graph  ...  -Minimum spanning trees on random points within narrow rectangles provide experimental subjects whose minimum number of crossings approach 0 in a controllable fashion Source code, scripts for generating  ...  ACKNOWLEDGMENTS Some of the initial crossing number experiments with 2-layer graphs posted on the Web in 1997 were organized and executed by Nevin Kapur.  ... 
doi:10.1145/945394.945402 fatcat:p637pafhy5afxnddpowhshsm4y

An Architecture for Privacy Preserving Collaborative Filtering on Web Portals

Waseem Ahmad, Ashfaq Khokhar
2007 Third International Symposium on Information Assurance and Security  
Moreover, the architecture employs an efficient crossing minimization based biclustering algorithm for collaborative filtering. This algorithm is easily amenable to privacy preserving implementation.  ...  Popular E-commerce portals such as Amazon and eBay require user personal data to be stored on their servers for serving these users with personalized recommendations.  ...  Secure Crossing Minimization As mentioned above, crossing minimization is done through Barycenter Heuristic. Barycenter heuristic is an iterative procedure.  ... 
doi:10.1109/isias.2007.4299786 fatcat:iwvgjelvrzfnto4kljsnfu7wx4

High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic [chapter]

Arifa Nisar, Waseem Ahmad, Wei-keng Liao, Alok Choudhary
2009 Proceedings of the 2009 SIAM International Conference on Data Mining  
In this paper, we provide a parallel algorithm for biclustering based on this formulation. We show that parallel energy minimization using barycenter heuristic is embarrassingly parallel.  ...  Experimental evaluation shows large superlinear speedups, scalability and high level of accuracy.  ...  Ashfaq khokar of University of Illinois, Chicago and anonymous reviewers for their insightful suggestions and helpful comments.  ... 
doi:10.1137/1.9781611972795.90 dblp:conf/sdm/NisarALC09 fatcat:frf2s3jwdnhajpqd4exesmbgxy

An Architecture for Privacy Preserving Collaborative Filtering on Web Portals

Waseem Ahmad, Ashfaq Khokhar
2007 Third International Symposium on Information Assurance and Security  
Communication Complexity of the Algorithm: Communication Cost for Crossing Minimization: During each of the k-iterations of the crossing minimization procedure, each node engages in share combining which  ...  We have noted that k is a fairly small number for most cases.  ...  and the other by items and the edge weight represents the encrypted rating shares. • Crossing minimization: This step performs a crossing minimization heuristic on the newly constructed Bigraph. • Bicluster  ... 
doi:10.1109/ias.2007.83 dblp:conf/IEEEias/AhmadK07 fatcat:cyjwvmxe6rauthhnm4sy7ckcxa

Bipartite-oriented distributed graph partitioning for big learning

Rong Chen, Jiaxin Shi, Binyu Zang, Haibing Guan
2014 Proceedings of 5th Asia-Pacific Workshop on Systems - APSys '14  
This article identifies the challenges and opportunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms  ...  partition algorithms that result in minimal vertex replication and network communication.  ...  Acknowledgments We thank the anonymous reviewers for their insightful comments. This work is supported in part Doctoral  ... 
doi:10.1145/2637166.2637236 dblp:conf/apsys/ChenSZG14 fatcat:y4zzvwrphnfpbp6dlkofo3qgj4

Bipartite-Oriented Distributed Graph Partitioning for Big Learning

Rong Chen, Jia-Xin Shi, Hai-Bo Chen, Bin-Yu Zang
2015 Journal of Computer Science and Technology  
This article identifies the challenges and opportunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms  ...  partition algorithms that result in minimal vertex replication and network communication.  ...  Acknowledgments We thank the anonymous reviewers for their insightful comments. This work is supported in part Doctoral  ... 
doi:10.1007/s11390-015-1501-x fatcat:2oa5et2lurdbrfobslycy4k2em

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

Michael Jünger, Petra Mutzel
1997 Journal of Graph Algorithms and Applications  
We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima.  ...  Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NP-hard, and that for the general problem with two variable layers  ...  Acknowledgements We would like to thank Thomas Ziegler for implementing and running all heuristics in this paper except LR-opt and Stefan Dresbach for helpful discussions concerning the stochastic heuristic  ... 
doi:10.7155/jgaa.00001 fatcat:quhd2aacavdkhctkoo72si2rxi

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms [chapter]

Michael Jünger, Petra Mutzel
2002 Graph Algorithms and Applications I  
We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima.  ...  Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NP-hard, and that for the general problem with two variable layers  ...  Acknowledgements We would like to thank Thomas Ziegler for implementing and running all heuristics in this paper except LR-opt and Stefan Dresbach for helpful discussions concerning the stochastic heuristic  ... 
doi:10.1142/9789812777638_0001 fatcat:m63fsafed5bs3ldcdbvk5huvnm

An efficient approach to constrained via minimization for two-layer VLSI routing

M. Tang, K. Eshraghian, Hon Nin Cheung
1999 Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)  
In this paper, a new approach is proposed for twolayer VLSI routing. This approach is able to handle any t ypes of routing, and allows arbitrary number of wire segments split at a via candidate.  ...  Abstract| Constrained Via Minimization is the problem of reassigning wire segments of a VLSI routing so that the number of vias is minimized.  ...  Therefore, existing routers and design tools can only consider the minimization of the number of tracks in channel routing, completion of switchbox routing, and wire length minimization as their primary  ... 
doi:10.1109/aspdac.1999.759982 dblp:conf/aspdac/TangEC99 fatcat:wpqfikdff5dg5ltmlow65knjem

Physically routing robots in a multi-robot network: Flexibility through a three-dimensional matching graph

Lantao Liu, Dylan A Shell
2013 The international journal of robotics research  
We propose a parametrizable method to tune emphasis between minimizing global travel cost (or energy, or distance), minimizing interruption (i.e., obtaining the fewest number of robot reassignments), reducing  ...  When new robots and tasks are added to a network of already deployed interchangeable robots, a trade-off arises in seeking to minimize cost to execute the tasks and the level of disruption to the system  ...  (a) Assumption of a shared node 0 at the crossing of path 1 → 0 → 2 and path 3 → 0 → 4.  ... 
doi:10.1177/0278364913498788 fatcat:p6vg3hmwm5aexjpog4uvgjb6am

Solving #SAT and MAXSAT by Dynamic Programming

Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle
2015 The Journal of Artificial Intelligence Research  
We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT.  ...  We present some limited experimental results, comparing implementations of our algorithms to state-of-the-art #SAT and MaxSAT solvers, as a proof of concept that warrants further research.  ...  We have designed and implemented a heuristic for step (1) finding a good decomposition, in this case a linear one where the binary tree describing the decomposition is a path with attached leaves.  ... 
doi:10.1613/jair.4831 fatcat:akaeiy75tbaibdntc7bwuojr44

Exact and heuristic algorithms for 2-layer straightline crossing minimization [chapter]

Michael Jünger, Petra Mutzel
1996 Lecture Notes in Computer Science  
We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima.  ...  Our computational results lead us to the conclusion that there is no need for heuristics if one layer is xed, even though the problem is NP-hard, and that for the general problem with two variable layers  ...  In section 4, we utilized this fact and the branch and cut algorithm of section 2 for the design and implementation of a program that solves the general two layer straightline crossing minimization problem  ... 
doi:10.1007/bfb0021817 fatcat:7iforxvbvrfzbetvmyuzx7kuxq

Mathematical methods for physical layout of printed circuit boards: an overview

Nadine Abboud, Martin Grötschel, Thorsten Koch
2007 OR spectrum  
This article surveys mathematical models and methods used for the physical layout of printed circuit boards, in particular component placement and wire routing.  ...  The experimental results demonstrate that their approach outperforms the Kernighan-Lin heuristics in terms of the number of crossings.  ...  This number depends only on the permutation of V i along y = i and not on specific x-coordinates. The bigraph crossing number  ... 
doi:10.1007/s00291-007-0080-9 fatcat:foqsqskbovgl3jif4wijlcajsm

VColor: A practical vertex-cut based approach for coloring large graphs

Yun Peng, Byron Choi, Bingsheng He, Shuigeng Zhou, Ruzhi Xu, Xiaohui Yu
2016 2016 IEEE 32nd International Conference on Data Engineering (ICDE)  
In particular, VColor is more than 500 times faster than SampleIS, and the number of colors used are comparable on real graphs Yeast and LS.  ...  Our extensive experimental evaluation on real-world graphs confirms the efficiency and/or effectiveness of our proposed techniques.  ...  Therefore, it is desired to minimize the number of CC's and minimize the size of each V CC's in H.  ... 
doi:10.1109/icde.2016.7498232 dblp:conf/icde/PengCHZXY16 fatcat:5lcoz343mbc5rni2mgq3sq5sx4

HET-GMP: A Graph-based System Approach to Scaling Large Embedding Model Training

Xupeng Miao, Yining Shi, Hailin Zhang, Xin Zhang, Xiaonan Nie, Zhi Yang, Bin Cui
2022 Proceedings of the 2022 International Conference on Management of Data  
The key insight guiding our design is the "graph way of thinking". HET-GMP creates a bigraph abstraction to represent the access relationships between data samples and embedding vectors.  ...  We evaluate the system on the embedding models for click-through rate (CTR) prediction, which presents the most significant challenge and communication bottleneck due to heavy access concurrency to a huge  ...  Based on the insight, we provide a sequential greedy heuristic to replicate embedding nodes on the partition (i.e., worker) that maximizes the expected cross-edges. We define the score formula in E.q.  ... 
doi:10.1145/3514221.3517902 fatcat:sndnhfvffveddhqzh2q3pgagj4
« Previous Showing results 1 — 15 out of 48 results