Filters








107,702 Hits in 8.1 sec

An experimental study of a simple, distributed edge-coloring algorithm

Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger
2005 ACM Journal of Experimental Algorithmics  
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple undirected graphs.  ...  a theoretical as well as practical standpoint) for edge coloring graphs quickly and efficiently in a distributed setting.  ...  Ravi Jain (Telecordia) for making available a copy of his papers. Finally, we thank Prof. T. Luzack, Prof. S.S. Ravi Dr. Vance Faber and Prof.  ... 
doi:10.1145/1005813.1041515 fatcat:l7zbwzecsfhqhnukd7g56u5xr4

An experimental study of a simple, distributed edge coloring algorithm

Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger
2000 Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures - SPAA '00  
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple undirected graphs.  ...  a theoretical as well as practical standpoint) for edge coloring graphs quickly and efficiently in a distributed setting.  ...  Ravi Jain (Telecordia) for making available a copy of his papers. Finally, we thank Prof. T. Luzack, Prof. S.S. Ravi Dr. Vance Faber and Prof.  ... 
doi:10.1145/341800.341820 dblp:conf/spaa/MarathePR00 fatcat:tleh45bqjfcv7onwpav5vn75lm

Applying Image Processing Algorithm to Dynamic Face Detection

Ming-Sung Chiu, Chien-Chih Lin, Chia-Sheng Cheng, Ming-Tsung Yeh, Yi-Nung Chung, Chao-Hsing Hsu
2021 Journal of Information Hiding and Multimedia Signal Processing  
An image processing algorithm is applied to detect dynamic human face. In this study, a Kalman filter algorithm is applied, which can track the dynamic human face.  ...  Based on the experimental results, the proposed algorithm in this paper can detect the motion face efficiently.  ...  In this study, the distribution of skin color is analyzed by using more than 3,000 images, and then determines the color space which needed for subsequent image processing.  ... 
dblp:journals/jihmsp/ChiuLCYCH21 fatcat:sawhp3hwrrhwrf7k6j27ir2cm4

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms

Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
2004 Algorithmica  
We perform an extensive experimental evaluation of very simple, distributed, randomized algorithms for (∆ + 1)-and so-called Brooks-Vizing vertex colorings, i.e., colorings using considerably fewer than  ...  We consider variants of algorithms known from the literature, boosting them with a distributed independent set computation.  ...  Introduction In this paper we perform an extensive experimental analysis of very simple, distributed vertex coloring algorithms.  ... 
doi:10.1007/s00453-004-1104-3 fatcat:ivdhehexpbezlpa76hlag24xym

The Strict Strong Coloring Based Graph Distribution Algorithm

Nousseiba Guidoum, Meriem Bensouyad, Djamel-Eddine Saïdouni
2013 International Journal of Applied Metaheuristic Computing  
The authors also report on a thorough experimental study to evaluate the performance of this new algorithm which depends strongly on the size, nature of the graphs, and the chosen number of workers.  ...  State space explosion is a fundamental obstacle in formal verification of concurrent systems. As a solution for this problem, this paper deals with distributed state space.  ...  As a variant, graph strict strong coloring has been defined in Haddad and Kheddouci (2009) where an exact algorithm for trees has been proposed.  ... 
doi:10.4018/jamc.2013010104 fatcat:63iucusgyjgkzp676as6vrd6f4

The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry)

Jan Dean Catarata, Scott Corbett, Harry Stern, Mario Szegedy, Tomas Vyskocil, Zheng Zhang
2017 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
We have noticed that in this case the algorithm settles at a metastable equilibrium (at least for the homogenous instances we have considered), a phenomenon mostly studied for physical systems.  ...  All results are experimental, although we discuss a possible reason behind some phenomena.  ...  We chose to study more closely the behaviors of the Resample Algorithm on the coloring problem of Grid/Torus graph type because the problem is very easy to picture. Probability Distributions.  ... 
doi:10.1137/1.9781611974768.13 dblp:conf/alenex/CatarataCSSVZ17 fatcat:ye4hhrbagrghhgjwp77333otni

A Distributed Approach for Frequency allocation using Graph Coloring in Mobile Networks

Vinod Maan, G. N. Purohit
2012 International Journal of Computer Applications  
This paper concerns a algorithmic problem for solving Maximal independent set of a graph in a distributed fashion and then reducing independent set to graph coloring.  ...  The proposed technique explores a general framework for studying distributed frequency allocation in mobile cellular network.  ...  Marathe [2004] have performed an empirical study of a distributed an empirical study of a distributed edge coloring.  ... 
doi:10.5120/9284-3476 fatcat:drk4fvvixvggvm6rapqd4z3u74

Distributed scheduling algorithms to improve the performance of parallel data transfers

Dannie Durand, Ravi Jain, David Tseytlin
1994 SIGARCH Computer Architecture News  
These algorithms, based on edge-coloring and matching of bipartite graphs, rely upon simple heuristics to obtain shorter schedules.  ...  These algorithms are based on the graph-theoretic notions of bipartite matching and edge-coloring. In Section 2, we survey recent w ork on parallel I/O and discuss how our work ts into this context.  ...  Acknowledgements We thank Alessandro Panconesi for useful discussions in the initial stages of this work. Bill Aiello, Sandeep Bhatt and Mark Sullivan of Bellcore also provided helpful feedback.  ... 
doi:10.1145/190787.190799 fatcat:yvdxrc4fffdmflfevwrqkd3ede

Distributed-Memory Parallel Algorithms for Matching and Coloring

Ümit V. Çatalyürek, Florin Dobrian, Assefaw Gebremedhin, Mahantesh Halappanavar, Alex Pothen
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
We discuss the design and implementation of new highlyscalable distributed-memory parallel algorithms for two prototypical graph problems, edge-weighted matching and distance-1 vertex coloring.  ...  We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors.  ...  Department of Energy through the CSCAPES Institute (grants DE-FC02-08ER25864 and DE-FC02-06ER2775),  ... 
doi:10.1109/ipdps.2011.360 dblp:conf/ipps/CatalyurekDGHP11 fatcat:bcnrc57vbbaztazensmjapde5m

Does more connectivity help groups to solve social problems

Daniel P. Enemark, Mathew D. McCubbins, Ramamohan Paturi, Nicholas Weller
2011 Proceedings of the 12th ACM conference on Electronic commerce - EC '11  
We explain why the negative effect of constraint trumps the positive effect of communication by analyzing coordination games as a special case of widely-studied constraint satisfaction problems.  ...  Recent experimental studies in the social and computer sciences have claimed that higher network connectivity helps individuals solve coordination problems.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1145/1993574.1993578 dblp:conf/sigecom/EnemarkMPW11 fatcat:gzgxvupbx5hj5bxzrudarmkwzu

A Low Complexity based Edge Color Matching Algorithm for Regular Bipartite Multigraph

Rezaul Karim, Muhammad Mahbub, Md. Rashedul, Md. Khaliluzzaman
2017 International Journal of Advanced Computer Science and Applications  
An edge coloring of a graph G is a process of assigning colors to the adjacent edges so that the adjacent edges represents the different colors.  ...  In this paper, an algorithm is proposed to find the perfect color matching of the regular bipartite multigraph with low time complexity.  ...  There are two terms of Graph coloring which are edge coloring and vertex coloring. In this paper, an algorithm is developed for edge coloring.  ... 
doi:10.14569/ijacsa.2017.080335 fatcat:igtibwg7izapvmyyp52xpo5u6e

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

José Antonio Martín H., Jérémie Bourdon
2013 PLoS ONE  
This article presents an algorithm that introduces a novel type of solution method to "efficiently" solve the graph 3-coloring problem; an NP-complete problem.  ...  In almost all of these problems, there is the need for proving a hypothesis about certain property of an object that can be present if and only if it adopts some particular admissible structure (an NP-certificate  ...  Finally, the experimental analysis confronts the algorithm with samples from a series of graph distributions to study its performance and contrast it with the theoretical results.  ... 
doi:10.1371/journal.pone.0053437 pmid:23349711 pmcid:PMC3544923 fatcat:m6dl3qctf5czlinhp6mbmnb5sy

Assessment of Object Segmentation Techniques for Object Based Image Retrieval

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
Objects relates more to human perception than any other attributes of an image. Image segmentation is a significant image processing technique to get the objects from complex image background.  ...  This work assesses the techniques of segmentation from basic global thresholding, edge based methods up to the advanced techniques such as K-means, Active Contour Model (Snakes) segmentation approaches  ...  First it locates the significant area of color distribution using Default Attention Window (DAW) and region merging algorithm has been applied to segment object.  ... 
doi:10.35940/ijitee.b1048.1292s19 fatcat:d7wggcphlnhclo6tydvqz4s2hq

Message passing for the coloring problem: Gallager meets Alon and Kahale

Sonny Ben-Shimon, Dan Vilenchik
2007 Discrete Mathematics & Theoretical Computer Science  
In 1994 Alon and Kahale exhibited a coloring algorithm and proved its usefulness for finding a k-coloring of graphs drawn from a certain planted-solution distribution over k-colorable graphs.  ...  In this work we show an interpretation of Alon and Kahale's coloring algorithm in light of Gallager's decoding algorithm, thus showing a connection between the two problems - coloring and decoding.  ...  Our result also gives a rigorous analysis of a message passing algorithm in the context of the colorability problem, while up until now only experimental results showed the usefulness of the message passing  ... 
doi:10.46298/dmtcs.3546 fatcat:vrjcaqrgc5ccfl4gob2vud426y

Message passing for the coloring problem: Gallager meets Alon and Kahale [article]

Sonny Ben-Shimon, Dan Vilenchik
2007 arXiv   pre-print
In 1994 Alon and Kahale exhibited a coloring algorithm and proved its usefulness for finding a k-coloring of graphs drawn from a certain planted-solution distribution over k-colorable graphs.  ...  In this work we show an interpretation of Alon and Kahale's coloring algorithm in light of Gallager's decoding algorithm, thus showing a connection between the two problems - coloring and decoding.  ...  Our result also gives a rigorous analysis of a message passing algorithm in the context of the colorability problem, while up until now only experimental results showed the usefulness of the message passing  ... 
arXiv:0710.3928v1 fatcat:6r2ulhui4vfhncsa2a3sra4hbe
« Previous Showing results 1 — 15 out of 107,702 results