In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
The premise of the work presented in this chapter is that much of the existing work on the generation of referring expressions has focused on aspects of the problem that appear to ...
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang...
We present a hybrid group key management protocol that incorporates both a centralized and a contributory scheme for key management, and a tree-based Elliptic Curve Diffie-Hellman...