ESeMan uses per-track KD-trees and caching to fetch summarized event data for parallel timelines in under 100ms for most tested traces while matching the raw rendering at pixel level.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.HC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Managing Data for Scalable and Interactive Event Sequence Visualization
ESeMan uses per-track KD-trees and caching to fetch summarized event data for parallel timelines in under 100ms for most tested traces while matching the raw rendering at pixel level.