EDBT 2026 Demo / reviewers in the wild / expert
Markus Zeilinger
dblp:55/10265
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0001-9810-8076ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Rendering · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering › volume rendering
empty space skipping |
0.8 | 1 | 2024 | Accelerating Transfer Function Update for Distance Map based Volume Rendering · IEEE VIS 2024 |
Rendering
volume rendering |
0.8 | 1 | 2024 | Accelerating Transfer Function Update for Distance Map based Volume Rendering · IEEE VIS 2024 |
Methods — techniques the papers use, named apart from their topics
ray casting · 0.8distance map computation · 0.8GPU acceleration · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Accelerating Transfer Function Update for Distance Map based Volume RenderingabstractDirect volume rendering using ray-casting is widely used in practice. By using GPUs and applying acceleration techniques as empty space skipping, high frame rates are possible on modern hardware. This enables performance-critical use-cases such as virtual reality volume rendering. The currently fastest known technique uses volumetric distance maps to skip empty sections of the volume during ray-casting but requires the distance map to be updated per transfer function change. In this paper, we demonstrate a technique for subdividing the volume intensity range into partitions and deriving what we call partitioned distance maps. These can be used to accelerate the distance map computation for a newly changed transfer function by a factor up to 30. This allows the currently fastest known empty space skipping approach to be used while maintaining high frame rates even when the transfer function is changed frequently. Michael Rauter, Lukas Zimmermann, Markus Zeilinger |
IEEE VIS | 3 |
| 2013 | ANANAS - A Framework for Analyzing Android ApplicationsabstractAndroid is an open software platform for mobile devices with a large market share in the smart phone sector. The openness of the system as well as its wide adoption lead to an increasing amount of malware developed for this platform. ANANAS is an expandable and modular framework for analyzing Android applications. It takes care of common needs for dynamic malware analysis and provides an interface for the development of plugins. Adaptability and expandability have been main design goals during the development process. An abstraction layer for simple user interaction and phone event simulation is also part of the framework. It allows an analyst to script the required user simulation or phone events on demand or adjust the simulation to his needs. Six plugins have been developed for ANANAS. They represent well known techniques for malware analysis, such as system call hooking and network traffic analysis. The focus clearly lies on dynamic analysis, as five of the six plugins are dynamic analysis methods. Thomas Eder, Michael Rodler, Dieter Vymazal, Markus Zeilinger |
ARES | 4 |
| 2011 | An On-Line Learning Statistical Model to Detect Malicious Web Requests
Harald Lampesberger, Philipp Winter, Markus Zeilinger, Eckehard Hermann |
SecureComm | 3 |