act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalen...
We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This provides for the first time ...
Ronan Collobert, Fabian H. Sinz, Jason Weston, L&e...
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...