As computers and networked systems have become an integral part of our daily lives, securing information from unauthorized access, misuse and modification has become very important.
Given a collection of vertices in a network, the problem of finding the minimum cost sub-network connecting a set of client nodes to a dedicated hub-node is the Steiner tree problem. Consider the following two twists.
The computer industry is at a major inflection point in its hardware roadmap due to the end of a decades-long trend of exponentially increasing clock frequencies.
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one.
The Euclidean shortest path problem in a polygonal region is one of the oldest and best-known in Computational Geometry due to its various applications.
A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear local constraint codes to be associated with
If networks of chemical reactions are the circuits of biology then catalysts are the transistors, or perhaps switches. But which species should be called catalysts? Come to the talk and find out.
