Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...