1,723,460 research outputs found
Urach / Red. v. Zinstag, gez. v. Schieber u. Dürrich ; Lith. v. F. Fleischmann
No full textURACH / RED. V. ZINSTAG, GEZ. V. SCHIEBER U. DÜRRICH ; LITH. V. F. FLEISCHMANN
Geognostische Karte von Württemberg (-)
Urach / Red. v. Zinstag, gez. v. Schieber u. Dürrich ; Lith. v. F. Fleischmann (No. 33) ( -
Die practische Anwendung der Schieber- und Coulissensteurungen /
No full textSpine title: Schieber- und Coulissensteurungen.Mode of access: Internet
Semantic-Controlled Gaussian Splatting for Outdoor Scene Reconstruction for Virtual Reality
No full textH. Schieber, J. Young, T. Langlotz, S. Zollmann and D. Roth, "Semantics-Controlled Gaussian Splatting for Outdoor Scene Reconstruction and Rendering in Virtual Reality," 2025 IEEE Conference Virtual Reality and 3D User Interfaces (VR), Saint Malo, France, 2025, pp. 318-328, doi: 10.1109/VR59515.2025.00056. keywords: {Visualization;Three-dimensional displays;Semantics;Virtual reality;User interfaces;Rendering (computer graphics);User experience;Real-time systems;Gaussian Splatting;Semantic Gaussian Splatting;Novel View Synthesis;Virtual Reality},
Link to IEEE paper: https://ieeexplore.ieee.org/document/10937476
@INPROCEEDINGS{10937476,
author={Schieber, Hannah and Young, Jacob and Langlotz, Tobias and Zollmann, Stefanie and Roth, Daniel},
booktitle={2025 IEEE Conference Virtual Reality and 3D User Interfaces (VR)},
title={Semantics-Controlled Gaussian Splatting for Outdoor Scene Reconstruction and Rendering in Virtual Reality},
year={2025},
pages={318-328},
doi={10.1109/VR59515.2025.00056}
ASDF: Assembly State Detection Utilizing Late Fusion by Integrating 6D Pose Estimation - Training Set - Corner Clamp Part 1
No full text<p>@article{schieber2024asdf,<br> title={ASDF: Assembly State Detection Utilizing Late Fusion by Integrating 6D Pose Estimation},<br> author={Schieber, Hannah and Li, Shiyu and Corell, Niklas and Beckerle, Philipp and Kreimeier, Julian and Roth, Daniel},<br> journal={arXiv preprint arXiv:2403.16400},<br> year={2024}<br>}</p>
Die Freiheit
No full textGedichtanfang Sag' einmal, freier Schweizersohn, Wie strahl' des Landes Licht?Gedicht; Kopftitel; Verfasser am Textende genannt: "Schieber"; Erscheinungsjahr anhand der Lebensdaten des Druckers geschätz
Fully Dynamic MIS in Uniformly Sparse Graphs
No full textWe consider the problem of maintaining a maximal independent set (MIS) in a dynamic graph subject to edge insertions and deletions. Recently, Assadi, Onak, Schieber and Solomon (STOC 2018) showed that an MIS can be maintained in sublinear (in the dynamically changing number of edges) amortized update time. In this paper we significantly improve the update time for uniformly sparse graphs. Specifically, for graphs with arboricity alpha, the amortized update time of our algorithm is O(alpha^2 * log^2 n), where n is the number of vertices. For low arboricity graphs, which include, for example, minor-free graphs as well as some classes of "real world" graphs, our update time is polylogarithmic. Our update time improves the result of Assadi et al. for all graphs with arboricity bounded by m^{3/8 - epsilon}, for any constant epsilon > 0. This covers much of the range of possible values for arboricity, as the arboricity of a general graph cannot exceed m^{1/2}
John Schieber and Dick Whetsell Harvesting Sideoats Grama Grass on the Foreman Faulkner Ranch
No full textPhotograph of combine driver John Schieber and range conservationist for the Soil Conservation Service at Pawhuska Dick Whetsell harvesting sideoats grama grass with a John Deere combine on Foreman Faulkner Ranch. People shown in photo go as followed from left to right: 1. John Schieber, 2. Dick Whetsell. The back of the photograph proclaims, "John Schieber, combine driver, and Dick Whetsell, range conservationist for the Soil Conservation Service at Pawhuska, in the sideoats grama grass harvest. Yields here averaged 25 to 40 pounds to the acre. The work was done under contract with the Soil Conservation Service.
City of Augusta Drainage Issue at the Industrial Park just North of US-54/US-400 / presented by Greg Schieber, State Transportation Engineer and Deputy Secretary, Kansas Department of Transportation.
No full text"April 23, 2024."
Information before the Kansas Legislature, House Committee on Appropriations and Senate Committee on Ways and Means, presented by Greg Schieber, State Transportation Engineer and Deputy Secretary, Kansas Department of Transportation."The City of Augusta industrial park is located on the southeast side of the city, north of US-400 and southeast of the BNSF Railway line. The Walnut River is located just east of the industrial park. The drainage for the eastern third of Augusta flows generally south and east towards the Walnut River through the industrial park. The drainage crosses US-400 just east of Lunger Road through a reinforced concrete box culvert (RCB) which was placed in 1975. The City of Augusta has experienced increased frequency of flooding events within the industrial park in recent years. ... The proposed solutions included several options for upstream detention as well as increasing the size of the RCB under US-400. The recommended alternative was to pursue increasing the size of the RCB. US-400 is owned and maintained by the Kansas Department of Transportation (KDOT). Any improvements to the culvert need to be coordinated with KDOT.
Approximating Connected Maximum Cuts via Local Search
No full textThe Connected Max Cut (CMC) problem takes in an undirected graph G(V,E) and finds a subset S ⊆ V such that the induced subgraph G[S] is connected and the number of edges connecting vertices in S to vertices in V⧵S is maximized. This problem is closely related to the Max Leaf Degree (MLD) problem. The input to the MLD problem is an undirected graph G(V,E) and the goal is to find a subtree of G that maximizes the degree (in G) of its leaves. [Gandhi et al. 2018] observed that an α-approximation for the MLD problem induces an (α)-approximation for the CMC problem.
We present an (log log |V|)-approximation algorithm for the MLD problem via local search. This implies an (log log |V|)-approximation algorithm for the CMC problem. Thus, improving (exponentially) the best known (log |V|) approximation of the Connected Max Cut problem [Hajiaghayi et al. 2015]
- …
