Hugues Hoppe

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Rodolfo S. Lima

> Home > Persons > Hugues Hoppe

Publications

2014
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/cgf/LiaoLNHS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cgf/LiaoLNHS14
Jing Liao, Rodolfo S. Lima, Diego Nehab, Hugues Hoppe, Pedro V. Sander:
Semi-Automated Video Morphing. Comput. Graph. Forum 33(4): 51-60 (2014)
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/NehabMLH14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/NehabMLH14
Diego Nehab, André Maximo, Rodolfo S. Lima, Hugues Hoppe:
Errata for GPU-Efficient Recursive Filtering and Summed-Area Tables. ACM Trans. Graph. 33(3): 33:1 (2014)
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/LiaoLNHSY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/LiaoLNHSY14
Jing Liao, Rodolfo S. Lima, Diego Nehab, Hugues Hoppe, Pedro V. Sander, Jinhui Yu:
Automating Image Morphing Using Structural Similarity on a Halfway Domain. ACM Trans. Graph. 33(5): 168:1-168:12 (2014)
2011
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/NehabMLH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/NehabMLH11
Diego Nehab, André Maximo, Rodolfo S. Lima, Hugues Hoppe:
GPU-efficient recursive filtering and summed-area tables. ACM Trans. Graph. 30(6): 176 (2011)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.