In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
— In this paper, we present an obstacle-aware clock tree synthesis method for through-silicon-via (TSV)-based 3D ICs. A unique aspect of this problem lies in the fact that variou...
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...