—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...
 The  fact  that  several  web  accessibility  metrics  exist  may  be  evidence  of  a  lack  of  a  comparison  framework  that  highlights  how  well  th...
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...
— In this paper, we present a method for extracting consistent foreground regions when multiple views of a scene are available. We propose a framework that automatically identiï¬...
When multiple data sources are available for clustering, an a priori data integration process is usually required. This process may be costly and may not lead to good clusterings,...
Elisa Boari de Lima, Raquel Cardoso de Melo Minard...