• Advances in conceptual modeling 

  Jeusfeld, Manfred A.; Karlapalem, Kamalakar (Springer, 2015)
• Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3 

  Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2015-06)

  The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the ...
• Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs 

  Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Springer, 2015-02)

  We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded tree-depth. We also show that the graph isomorphism problem is fixed parameter tractable for a related parameterized graph ...
• On learning mixture models for permutations 

  Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi; Lattanzi, Silvio (ACM Digital Library, 2015-01-02)

  In this paper we consider the problem of learning a mixture of permutations, where each component of the mixture is generated by a stochastic process. Learning permutation mixtures arises in practical settings when a set ...
• Colored hypergraph isomorphism is fixed parameter tractable 

  Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke (Springer, 2013-04)

  We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2 b N) O(1), where the parameter b is the maximum size of the color classes of the given ...
• On reconstructing a hidden permutation 

  Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi; Lattanzi, Silvio (DROPS, 2014-09-04)

  The Mallows model is a classical model for generating noisy perturbations of a hidden permutation, where the magnitude of the perturbations is determined by a single parameter. In this work we consider the following ...
• An Intelligent Swarm of Markovian Agents 

  Bobbio, Andrea; Dario, Bruneo; Davide, Cerotti; Gribaudo, Marco; Marco, Scarpa (DiSIT, Computer Science Institute, UPO, Alessandria, 2014-06)

  We define a Markovian Agent Model (MAM) as an analytical model formed by a spatial collection of interacting Markovian Agents (MAs), whose properties and behavior can be evaluated by numerical techniques. MAMs have been ...
• Zero knowledge and circuit minimization 

  Allender, Eric; Das, Bireswar (2014-08-25)
• On estimating the average degree 

  Dasgupta, Anirban; Kumar, Ravi; Sarlos, Tamas (2014-04-11)
• Colored Hypergraph Isomorphism is Fixed Parameter Tractable 

  Arvind, V.; Das, Bireswar; Köbler, Johannes; Seinosuke, Toda (2010)

  We describe a xed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2 O (b)NO(1), where the parameter is the maximum size of the color classes of the given hypergraphs and N ...
• A Survey of Database Intrusion Detection Approaches for Database Security 

  Rao, Udai Pratap; Patel, Dhiren R. (2010-01)
• Machine learning proposed approach for detecting database intrusions in RBAC enabled databases 

  Rao, Udai Pratap; Sahani, G. J.; Patel, Dhiren R. (Institute of Electrical and Electronics Engineers (IEEE), 2010)

  Information is valuable asset of any organization which is stored in databases. Data in such databases may contain credit card numbers, social security number or personal medical records etc. Failing to protect these ...
• Policy extension for data access control 

  Arunkumar, S.; Raghavendra, A.; Weerasinghe, D.; Patel, Dhiren R.; Rajarajan, Muttukrishnan (Institute of Electrical and Electronics Engineers (IEEE), 2010)

  In this paper, we propose a security framework, looking at different policies for data access control in the mobile environments. We have started with extending the Platform for Privacy Preferences (P3P) policy for controlling ...
• Maintaining privacy and data quality in privacy preserving association rule mining 

  Modi, Chirag; Rao, Udai Pratap; Patel, Dhiren R. (Institute of Electrical and Electronics Engineers (IEEE), 2010)

  Privacy preserving data mining (PPDM) is a novel research direction to preserve privacy for sensitive knowledge from disclosure. Many of the researchers in this area have recently made effort to preserve privacy for sensitive ...
• An efficient approach for preventing disclosure of sensitive association rules in databases 

  Modi, Chirag; Rao, Udai Pratap; Patel, Dhiren R. (2010-07-12)
• A Survey on Preserving Privacy for Sensitive Association Rules in Databases 

  Modi, Chirag; Rao, Udai Pratap; Patel, Dhiren R. (2010-03)

  Privacy preserving data mining (PPDM) is a novel research area to preserve privacy for sensitive knowledge from disclosure. Many of the researchers in this area have recently made effort to preserve privacy for sensitive ...
• Cryptographic Key Management for SCADA System: An Architectural Framework 

  Patel, Dhiren R.; Pal, Om; Saiwan, S.; Jain, Pritish; Saquib, Zia (Institute of Electrical and Electronics Engineers (IEEE), 2009-12)

  SCADA (Supervisory Control And Data Acquisition) security has become a challenging issue today because of its connectivity with the outside world and remote access to the system. One critical security aspect for SCADA ...
• Maximum Matchings via Glauber Dynamics 

  Jindal, Anant; Kochar, Gazal; Pal, Manjish (arXiv, Cornell University Library, 2011-07)

  In this paper we study the classic problem of computing a maximum cardinality matching in general graphs G=(V,E). The best known algorithm for this problem till date runs in O(mn√) time due to Micali and Vazirani \cite{MV80}. ...
• The Entropy Influence Conjecture Revisited 

  Das, Bireswar; Pal, Manjish; Visavaliya, Vijay (arXiv, Cornell University Library, 2011-10)

  In this paper, we prove that most of the boolean functions, f : {−1, 1} n → {−1, 1}satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai(Proc. AMS’96)[1]. The conjecture says that the Entropy of ...
• Succinct Encodings of Graph Isomorphism 

  Das, Bireswar (Springer, 2014)

  It is well known that problems encoded with circuits or formulas generally gain an exponential complexity blow-up compared to their original complexity. We introduce a new way for encoding graph problems, based on CNF or ...

View more