Erweiterte Suche der Leibniz Universität Hannover
Weitere Suchvorschläge: retrieval, features, shots, video
1 bis 15 von 3236 Ergebnissen
Then, recovering the already established sea floor depths and overhead heights, it can compute the two clearances for safe navigation without any reference to the time-variant tides, tidal datums, and ship’s draft. 117 George A. Maul and Muneendra Kumar This article describes the surveying mode to establish time-invariant ellipsoid depths or heights of the sea floor in the open ocean. 2 Surveying the Sea Floor and Overhead St...
Relating polynomial time to constant depth authored by H. Vollmer Organisation s Institute of Theoretical Computer Science Type Article Journal Theoretical computer science ISSN 0304 3975 Publication date 1998 Publication status Published Peer reviewed Yes Electronic version s https://doi.org/10.1016/S0304 3975 98 00061 9 Access: Unknown BibTeX article ba9f512fd2d9460095558c53960db042, title Relating polynomial time to constant de...
Verifying proofs in constant depth. verfasst von Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Organisationseinheit en Institut für Mikrobiologie Institut für Theoretische Informatik Typ Artikel Journal ACM Trans.
Verifying Proofs in Constant Depth verfasst von Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Organisationseinheit en Institut für Mikrobiologie Institut für Theoretische Informatik Typ Artikel Journal Electron.
Relating polynomial time to constant depth verfasst von H. Vollmer Organisationseinheit en Institut für Theoretische Informatik Typ Artikel Journal Theoretical computer science ISSN 0304 3975 Publikationsdatum 1998 Publikationsstatus Veröffentlicht Peer reviewed Ja Elektronische Version en https://doi.org/10.1016/S0304 3975 98 00061 9 Zugang: Unbekannt BibTeX article ba9f512fd2d9460095558c53960db042, title Relating polynomial time to ...
Verifying Proofs in Constant Depth. verfasst von Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Organisationseinheit en Institut für Mikrobiologie Institut für Theoretische Informatik Typ Aufsatz in Konferenzband Seiten 84 95 Publikationsdatum 2011 Publikationsstatus Veröffentlicht Peer reviewed Ja Elektronische Version en https://dblp.org/rec/journals/...
Robust Regression for Monocular Depth Estimation verfasst von Julian Lienen, Nils Nommensen, Ralph Ewerth, Eyke Hüllermeier Abstract Learning accurate models for monocular depth estimation requires precise depth annotation as e.g. gathered through LiDAR scanners. Because the data acquisition with sensors of this kind is costly and does not scale well in general, less advanced depth sources, such as time of f...
Verifying proofs in constant depth. authored by Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Organisation s Institute of Microbiology Institute of Theoretical Computer Science Type Article Journal ACM Trans.
Relating polynomial time to constant depth verfasst von H. Vollmer Organisationseinheit en Institut für Theoretische Informatik Typ Artikel Journal Theoretical computer science ISSN 0304 3975 Publikationsdatum 1998 Publikationsstatus Veröffentlicht Peer reviewed Ja Elektronische Version en https://doi.org/10.1016/S0304 3975 98 00061 9 Zugang: Unbekannt BibTeX article ba9f512fd2d9460095558c53960db042, title Relating polynomial time to ...
Verifying Proofs in Constant Depth authored by Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Organisation s Institute of Microbiology Institute of Theoretical Computer Science Type Article Journal Electron.
Verifying Proofs in Constant Depth. authored by Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Organisation s Institute of Microbiology Institute of Theoretical Computer Science Type Conference contribution Pages 84 95 Publication date 2011 Publication status Published Peer reviewed Yes Electronic version s https://dblp.org/rec/journals/eccc/Beyersdorff...
To increase the number of video shots for which the depth feature extraction method is applicable, we present an extension of the self calibration algorithm of this method. Furthermore, a depth map representation is presented and an adequate distance measure is suggested to compare depth maps. Finally, the extracted depth features are used to retrieve video shots according to the three dimensional scene cont...
Estimating relative depth in single images via rankboost verfasst von Ralph Ewerth, Matthias Springstein, Alexander Balz, Jan Gehlhaar, Tolga Naziyok, Krzysztof Dembczynski, Eyke Hullermeier, Eric Müller Budack Abstract In this paper, we present a novel approach to estimate the relative depth of regions in monocular images. There are several contributions. First, the task of monocular depth estimation is considered a...
To increase the number of video shots for which the depth feature extraction method is applicable, we present an extension of the self calibration algorithm of this method. Furthermore, a depth map representation is presented and an adequate distance measure is suggested to compare depth maps. Finally, the extracted depth features are used to retrieve video shots according to the three dimensional scene cont...
Estimating relative depth in single images via rankboost authored by Ralph Ewerth, Matthias Springstein, Alexander Balz, Jan Gehlhaar, Tolga Naziyok, Krzysztof Dembczynski, Eyke Hullermeier, Eric Müller Budack Abstract In this paper, we present a novel approach to estimate the relative depth of regions in monocular images. There are several contributions. First, the task of monocular depth estimation is considered as...
1 bis 15 von 3236 Ergebnissen
