97 search results - page 9 / 20 » Random Sampling from Pseudo-Ranked B Trees |
232
click to vote
NLP
2000
15 years 5 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...
138
Voted
WEA
2010
Springer
15 years 8 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 ...
155
click to vote
ICASSP
2008
IEEE
15 years 8 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...
116
click to vote
CVPR
2007
IEEE
16 years 3 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 ...
152
Voted
FOCS
2009
IEEE
15 years 8 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...