output
20112023
most citeddtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts

24 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

6 papers

cs.CG2023

Optimizing Symbol Visibility through Displacement

Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy +3

In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positi…

cs.AI2021★ 24 cited

dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts

Pranav Ashok, Mathias Jackermeier, Jan Křetínský +3

Recent advances have shown how decision trees are apt data structures for concisely representing strategies (or controllers) satisfying various objectives. Moreover, they also make…

cs.CV2019

Character Keypoint-based Homography Estimation in Scanned Documents for Efficient Information Extraction

Kushagra Mahajan, Monika Sharma, Lovekesh Vig

Precise homography estimation between multiple images is a pre-requisite for many computer vision applications. One application that is particularly relevant in today's digital era…

cs.DS2015

Randomised Rounding with Applications

Dhiraj Madan, Sandeep Sen

We develop new techniques for rounding packing integer programs using iterative randomized rounding. It is based on a novel application of multidimensional Brownian motion in $\mat…

cs.CR2013★ 1 cited

Detection and prevention of botnets and malware in an enterprise network

Manoj Rameshchandra Thakur, Divye Raj Khilnani, Kushagra Gupta +5

One of the most significant threats faced by enterprise networks today is from Bots. A Bot is a program that operates as an agent for a user and runs automated tasks over the inter…

cs.DS2011★ 3 cited

Fully dynamic maximal matching in O(log n) update time

Surender Baswana, Manoj Gupta, Sandeep Sen

We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized ti…