Over the years, data centers have reinvented themselves through virtualization, the cloud and AI. The next iteration is ...

We provide a practical implementation of maximum clique enumeration algorithm for massive networks. James Cheng, Yiping Ke, Ada Fu, Jeffrey Xu Yu, Linhong Zhu: Finding Maximal Cliques in Massive ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

Abstract: In applied and numerical algebraic geometry, many problems are reduced to computing an approximation to a real algebraic curve. In order to elevate the results of such a computation to the ...

We present a new optimization-based method for aggregating preferences in settings in which each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

Abstract: Finding the shortest vector in a lattice is a NP-hard problem. The best known approximation algorithm for this problem is LLL algorithm with the approximation factor of αn-1\2, α≥4\3, which ...

What would you like to Propose? Hey I saw a Feature Request for Edmond Algorithm and wanted to add another Algorithm - Edmonds Blossom Algorithm, under the data structure/graphs The Edmonds Blossom ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...