Search Results for author: Johannes Fischer

Found 8 papers, 5 papers with code

Information Particle Filter Tree: An Online Algorithm for POMDPs with Belief-Based Rewards on Continuous Domains

1 code implementation ICML 2020 Johannes Fischer, Ömer Sahin Tas

Partially Observable Markov Decision Processes (POMDPs) inherently gather the information necessary to act optimally under uncertainties.

ZigMa: A DiT-style Zigzag Mamba Diffusion Model

1 code implementation20 Mar 2024 Vincent Tao Hu, Stefan Andreas Baumann, Ming Gui, Olga Grebenkova, Pingchuan Ma, Johannes Fischer, Björn Ommer

The diffusion model has long been plagued by scalability and quadratic complexity issues, especially within transformer-based structures.

PITA: Physics-Informed Trajectory Autoencoder

no code implementations18 Mar 2024 Johannes Fischer, Kevin Rösch, Martin Lauer, Christoph Stiller

To resolve this issue, we propose the novel Physics-Informed Trajectory Autoencoder (PITA) architecture, whichincorporates a physical dynamics model into the loss functionof the autoencoder.

Launch Power Optimization for Dynamic Elastic Optical Networks over C+L Bands

no code implementations25 Aug 2023 Farhad Arpanaei, Mahdi Ranjbar Zefreh, José Alberto Hernández, Behnam Shariati, Johannes Fischer, José Manuel Rivas-Moscoso, Filipe Jiménez, Juan Pedro Fernández-Palacios, David Larrabeiti

We propose an algorithm for calculating the optimum launch power over the entire C+L bands by maximizing the cumulative link GSNR of a channel plan built upon multiple modulation formats, with application to dynamic EONs.

Simple, Fast and Lightweight Parallel Wavelet Tree Construction

1 code implementation24 Feb 2017 Johannes Fischer, Florian Kurpicz, Marvin Löbel

The wavelet tree (Grossi et al. [SODA, 2003]) and wavelet matrix (Claude et al. [Inf.

Data Structures and Algorithms

Engineering a Distributed Full-Text Index

1 code implementation11 Oct 2016 Johannes Fischer, Florian Kurpicz, Peter Sanders

The result is that our index answers counting queries up to 5. 5 times faster than the distributed suffix array, while using about the same space.

Data Structures and Algorithms

Cannot find the paper you are looking for? You can Submit a new open access paper.