Cart
Create Account
Sign In
Collection:
Learning to hash via generative models has become a promising paradigm for fast similarity search in document retrieval. The binary hash codes are treated as Bernoulli latent variables when training a variational autoencoder (VAE). However, the prior of d
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Videos in this product
Discrete Wasserstein Autoencoders For Document Retrieval
Learning to hash via generative models has become a promising paradigm for fast similarity search in document retrieval. The binary hash codes are treated as Bernoulli latent variables when training a variational autoencoder (VAE). However, the prior of d