A Comparative Study of Algorithm for Computing Strongly Connected Components

Hsu, David; Lan, Xiaojie; Miller, G. I.; Baird, David

doi:10.1109/dasc-picom-datacom-cyberscitec.2017.85

Cited by 7 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are efficient algorithms for computing the SCCs of a graph such as Tarjan, which take linear time O(|V |+|E|) assuming constant time for retrieving edges [9]. It is useful to observe that cycles in a graph G can never span across multiple SCCs (since if there were any such cycle, the SCCs involved would form a bigger SCC, which contradicts its maximality w.r.t.…”

Section: Preliminariesmentioning

confidence: 99%

Refining Transitive and Pseudo-Transitive Relations at Web Scale

et al. 2021

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Refining Transitive and Pseudo-Transitive Relations at Web Scale

et al. 2021

View full text Add to dashboard Cite

show abstract

“…To put a nutshell, our work that has been detailed in [2] consists primarily in constructing an ad hoc directed graph related to the RC5-CBC and then confirming its strong connectivity using the optimized method referred as Kosaraju's Depth First Traversal (DFS) algorithm [10], [14].…”

Section: A Proving Of Chaotic Behavior Of Rc5-cbc Block Ciphermentioning

confidence: 99%

Statistical Analysis and Security Evaluation of Chaotic RC5-CBC Symmetric Key Block Cipher Algorithm

Abidi

Sghaier

Bakiri

et al. 2019

IJACSA

View full text Add to dashboard Cite

In some previous research works, it has been theoretically proven that RC5-CBC encryption algorithm behaves as a Devaney topological chaos dynamical system. This unpredictable behavior has been experimentally illustrated through such sensitivity tests analyses encompassing the avalanche effect phenomenon evaluation. In this paper, which is an extension of our previous work, we aim to prove that RC5 algorithm can guarantee a much better level of security and randomness while behaving chaotically, namely when embedded with CBC mode of encryption. To do this, we have began by evaluating the quality of such images encrypted under chaotic RC5-CBC symmetric key encryption algorithm. Then, we have presented the synthesis results of an hardware architecture that implements this chaotic algorithm in FPGA circuits.

show abstract

“…We develop a new technique called connectivity augmentation to resolve the issue. We apply Kosaraju's algorithm [18] against the constructed routing layer. This step (line 6) adjusts the routing layer by adding minimal number of edges to make the graph strongly connected without destroying its small world properties.…”

Section: Routing Layer Constructionmentioning

confidence: 99%

Zoom: SSD-based Vector Search for Optimizing Accuracy, Latency and Memory

Zhang,

2018

Preprint

View full text Add to dashboard Cite

With the advancement of machine learning and deep learning, vector search becomes instrumental to many information retrieval systems, to search and find best matches to user queries based on their semantic similarities. These online services require the search architecture to be both effective with high accuracy and efficient with low latency and memory footprint, which existing work fails to offer. We develop, Zoom, a new vector search solution that collaboratively optimizes accuracy, latency and memory based on a multiview approach.(1) A "preview" step generates a small set of good candidates, leveraging compressed vectors in memory for reduced footprint and fast lookup. (2) A "fullview" step on SSDs reranks those candidates with their full-length vector, striking high accuracy. Our evaluation shows that, Zoom achieves an order of magnitude improvements on efficiency while attaining equal or higher accuracy, comparing with the state-of-the-art.

show abstract

A Comparative Study of Algorithm for Computing Strongly Connected Components

Cited by 7 publications

References 9 publications

Refining Transitive and Pseudo-Transitive Relations at Web Scale

Refining Transitive and Pseudo-Transitive Relations at Web Scale

Statistical Analysis and Security Evaluation of Chaotic RC5-CBC Symmetric Key Block Cipher Algorithm

Zoom: SSD-based Vector Search for Optimizing Accuracy, Latency and Memory

Contact Info

Product

Resources

About