Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Falko Kuester

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 Mauricio Hess-Flores

> Home > Persons > Falko Kuester

Publications

2011
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/isvc/KnoblauchHDJK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isvc/KnoblauchHDJK11
Daniel Knoblauch, Mauricio Hess-Flores, Mark A. Duchaineau, Kenneth I. Joy, Falko Kuester:
Non-Parametric Sequential Frame Decimation for Scene Reconstruction in Low-Memory Streaming Environments. ISVC (1) 2011: 359-370
[c27]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/psivt/Hess-FloresKDJK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/psivt/Hess-FloresKDJK11
Mauricio Hess-Flores, Daniel Knoblauch, Mark A. Duchaineau, Kenneth I. Joy, Falko Kuester:
Ray Divergence-Based Bundle Adjustment Conditioning for Multi-view Stereo. PSIVT (1) 2011: 153-164
2009
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/isvc/KnoblauchHDK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isvc/KnoblauchHDK09
Daniel Knoblauch, Mauricio Hess-Flores, Mark A. Duchaineau, Falko Kuester:
Factorization of Correspondence and Camera Error for Unconstrained Dense Correspondence Applications. ISVC (1) 2009: 720-729

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.