Sciweavers

1728 search results - page 42 / 346
» The Accelerated Euclidean Algorithm
Sort
View
135
Voted
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
15 years 2 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
125
Voted
SAMOS
2009
Springer
15 years 7 months ago
CABAC Accelerator Architectures for Video Compression in Future Multimedia: A Survey
The demands for high quality, real-time performance and multi-format video support in consumer multimedia products are ever increasing. In particular, the future multimedia systems...
Yahya Jan, Lech Józwiak
127
Voted
PSIVT
2007
Springer
143views Multimedia» more  PSIVT 2007»
15 years 8 months ago
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
Fajie Li, Reinhard Klette, Xue Fu
118
Voted
ICIP
2003
IEEE
16 years 4 months ago
Performance evaluation of Euclidean/correlation-based relevance feedback algorithms in content-based image retrieval systems
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
Anastasios D. Doulamis, Nikolaos D. Doulamis
110
Voted
FOCS
2006
IEEE
15 years 8 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk