Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

In today's data-driven era, the speed and accuracy of information retrieval have become increasingly important. Since I first proposed the EFANNA algorithm during my doctoral studies in 2016, I ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

This paper presents a detailed review of both theory and algorithms for the Cheeger cut based on the graph 1-Laplacian. In virtue of the cell structure of the feasible set, we propose a cell descend ...

The stochastic approximation EM (SAEM) algorithm is a simulation-based alternative to the expectation/maximization (EM) algorithm for situations when the E-step is ...