1728 search results - page 205 / 346 » The Accelerated Euclidean Algorithm |
125
Voted
ACCV
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we propose a novel occlusion invariant face recognition algorithm based on Selective Local Nonnegative Matrix Factorization (S-LNMF) technique. The proposed algorith...
132
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
115
click to vote
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
115
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
181
click to vote
STOC
1998
ACM
15 years 7 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...