497 search results - page 14 / 100 » On a Parallel Extended Euclidean Algorithm |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
DEBS
2008
ACM
13 years 9 months ago
2008
ACM
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
CF
2004
ACM
14 years 1 months ago
2004
ACM
Centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption and are thus not suitable for consumer electronic devices. The conse...
ICCV
2009
IEEE
15 years 21 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...