d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, w...
Jing Lin, Akshaya Srivatsa, Andreas Gerstlauer, Br...
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...