187 search results - page 4 / 38 » On algorithms for discrete and approximate brouwer fixed poi... |
SODA
1993
ACM
13 years 8 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
NIPS
2008
13 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
PAMI
2012
11 years 10 months ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...