356 search results - page 38 / 72 » Further results on the subspace distance |
IPL
2002
13 years 9 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
SIAMDM
2010
13 years 8 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
ACCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...
COMGEO
2007
ACM
13 years 10 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
ISMIR
2004
Springer
14 years 3 months ago
2004
Springer
Melodic segmentation is an important topic for music information retrieval, because it divides melodies into musically relevant units. Most influential theories on melodic segmen...