The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...