We present a shape matching algorithm based on the chamfer distance transform which can be easily integrated into the well-known SIFT framework. The shape matching was designed to...
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
— In this paper we illustrate how sensitivities can be used to provide a practical precursor to dynamic transitions and numerical uncertainty in parameterized nonlinear parabolic...
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...