The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
The lack of publicly available annotated databases is one of the major barriers to research advances on emotional information processing. In this contribution we present a recentl...
Michael Grimm, Kristian Kroschel, Shrikanth Naraya...
Behavior understanding and semantic interpretation of dynamic visual scenes have attracted a lot of attention in computer vision research community. Although the use of surveillan...
Ahmed Azough, Alexandre Delteil, Fabien De Marchi,...