Hough voting methods efficiently handle the high complexity of multiscale,
category-level object detection in cluttered scenes. The primary weakness
of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...