We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Visual understanding is often based on measuring similarity between observations. Learning similarities specific to a certain perception task from a set of examples has been show...
Michael Bronstein, Alexander Bronstein, Nikos Para...
The problem of passive localization is commonly solved by independently measuring intermediate parameters (such as angles of arrival (AOA), times of arrival (TOA)...) on several m...
We propose three distance measures for genetic search space. One is a distance measure in the population space that is useful for understanding the working mechanism of genetic al...