140 search results - page 10 / 28 » Random projection algorithms for convex set intersection pro... |
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
107
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
SSIAI
2002
IEEE
15 years 4 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
112
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
107
click to vote
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...