—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
Tian Shen, Xiaolei Huang, Hongsheng Li, Edward Kim...
Abstract—Many important real-world systems, modeled naturally as complex networks, have heterogeneous interactions and complicated dependency structures. Link prediction in such ...
Darcy A. Davis, Ryan Lichtenwalter, Nitesh V. Chaw...
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...