We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that t...
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...
A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this q...
Karl Schnaitter, Joshua Spiegel, Neoklis Polyzotis
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank ...
Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham