Gerhard R. Cadek

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 Jörg Brodersen

> Home > Persons > Gerhard R. Cadek

Publications

2007
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ejes/FurtlerMEBNC07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejes/FurtlerMEBNC07
Johannes Fürtler, Konrad J. Mayer, Christian Eckel, Joerg Brodersen, Herbert Nachtnebel, Gerhard R. Cadek:
Geometry Unit for Analysis of Warped Image Features on Programmable Chips. EURASIP J. Embed. Syst. 2007 (2007)
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ejes/FurtlerRBNMCE07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejes/FurtlerRBNMCE07
Johannes Fürtler, Peter Rössler, Joerg Brodersen, Herbert Nachtnebel, Konrad J. Mayer, Gerhard R. Cadek, Christian Eckel:
Design Considerations for Scalable High-Performance Vision Systems Embedded in Industrial Print Inspection Machines. EURASIP J. Embed. Syst. 2007 (2007)
2006
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/rivp/FurtlerBRMCEN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rivp/FurtlerBRMCEN06
Johannes Fürtler, Jörg Brodersen, Peter Rössler, Konrad J. Mayer, Gerhard R. Cadek, Christian Eckel, Herbert Nachtnebel:
Architecture for hardware driven image inspection based on FPGAs. Real-Time Image Processing 2006: 60630D

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.