Sciweavers

510 search results - page 4 / 102
» Adaptive Distances on Sets of Vectors
Sort
View
ACNS
2004
Springer
142views Cryptology» more  ACNS 2004»
13 years 10 months ago
S-RIP: A Secure Distance Vector Routing Protocol
Distance vector routing protocols (e.g., RIP) have been widely used on the Internet, and are being adapted to emerging wireless ad hoc networks. However, it is well-known that exis...
Tao Wan, Evangelos Kranakis, Paul C. van Oorschot
WSCG
2004
169views more  WSCG 2004»
13 years 6 months ago
Distance Field Compression
This paper compares various techniques for compressing floating point distance fields. Both lossless and lossy techniques are compared against a new lossless technique. The new Ve...
Mark W. Jones
ICIP
2007
IEEE
13 years 11 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
GBRPR
2007
Springer
13 years 9 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion
DCC
1999
IEEE
13 years 9 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega