40 search results - page 1 / 8 » Efficient Euclidean projections in linear time |
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...