1652 search results - page 71 / 331 » Matching Vector Codes |
SIAMDM
2002
14 years 11 months ago
2002
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
JILP
2000
14 years 11 months ago
2000
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
103
click to vote
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear sim...
WWW
2006
ACM
15 years 12 months ago
2006
ACM
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
TVCG
2012
13 years 1 months ago
2012
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...