97 search results - page 9 / 20 » Random Sampling from Pseudo-Ranked B Trees |
NLP
2000
13 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...