This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
We report on an extensive series of highly controlled human subject experiments in networked trade. Our point of departure is a simple and well-studied bipartite network exchange ...
This paper tackles an important aspect of the variational problem underlying active contours: optimization by gradient flows. Classically, the definition of a gradient depends d...
Guillaume Charpiat, Pierre Maurel, Jean-Philippe P...
A major difficulty in compiler development regards the proper modularization of concerns among the various compiler phases. The traditional object-oriented development paradigm ha...