We show how a greedy approach to visual search — i.e., directly moving to the most likely location of the target — can be suboptimal, if the target object is hard to detect. I...
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
Linear systems with structures such as Toeplitz-, Vandermonde- or Cauchy-likeness can be solved in O˜(α2 n) operations, where n is the matrix size, α is its displacement rank, ...
Extended argumentation framework is a formalism where defeat relations are determined by establishing a preference between arguments involved in symmetric conflicts. This process ...
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...