CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
JMLC
2000
Springer
13 years 8 months ago
2000
Springer
An enhancement to modular languages called module embedding facilitates the development and utilization of secure generic parallel algorithms.
IDMS
1997
Springer
13 years 8 months ago
1997
Springer
The recent popularity of digital media such as CD-ROM and the Internet has prompted exploration of techniques for embedding data, either visibly or invisibly, into text, image, and...
ICMCS
1999
IEEE
13 years 8 months ago
1999
IEEE
A variety of digital watermarking applications have emerged recently that require the design of systems for embedding one signal (the "embedded signal" or "watermar...
CGI
1999
IEEE
13 years 8 months ago
1999
IEEE
Existing data embedding algorithms for polygonal meshes and their attributes can't be applied to the majority of (geometric) computer aided design (CAD) applications, for two...
PG
2003
IEEE
13 years 9 months ago
2003
IEEE
Digital watermarking is a technique for embedding information into data, such as images, 3D models, or audio files, such that some properties (i. e., security, imperceptibility, ...
INFOCOM
2003
IEEE
13 years 9 months ago
2003
IEEE
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
VLDB
2005
ACM
13 years 9 months ago
2005
ACM
A fundamental concern of information integration in an XML context is the ability to embed one or more source documents in a target document so that (a) the target document confor...
SCALESPACE
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
SACRYPT
2005
Springer
13 years 9 months ago
2005
Springer
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...