1233 search results - page 16 / 247 » Extensible Point Location Algorithm |
144
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
105
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
115
click to vote
JMIV
2007
15 years 17 days ago
2007
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(9...
100
click to vote
ICIAP
2007
ACM
16 years 24 days ago
2007
ACM
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(...
96
Voted
SIAMJO
2000
15 years 14 days ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...