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 ...
University of Virginia School of Engineering and Applied Science professor Nikolaos Sidiropoulos has introduced a breakthrough in graph mining with the development of a new computational algorithm.
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 ...
Abstract: The Conflict-Based Search Weighted Dependency Graph algorithm is one of the optimal algorithms for multi-robot path planning. Although this algorithm can find optimal solutions relatively ...
Abstract: The successful identification of stars is a fundamental prerequisite for satellite attitude determination by star sensors. Conventional star identification algorithms typically construct ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results