406 search results - page 44 / 82 » A Cost Model for Similarity Queries in Metric Spaces |
GRID
2007
Springer
13 years 11 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
MLDM
1999
Springer
13 years 12 months ago
1999
Springer
Content-based image retrieval methods based on the Euclidean metric expect the feature space to be isotropic. They suer from unequal dierential relevance of features in comput...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
JCIT
2007
13 years 7 months ago
2007
Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it ...
CG
2004
Springer
13 years 7 months ago
2004
Springer
Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlus...