Browsing Journal Articles by Title

Browsing Journal Articles by Title

Sort by: Order: Results:

  • Fast rumor source identification via random walks 
    Garg, Dinesh; Jain, Alankar; Borkar, Vivek (Springer Vienna, 2016-12)
    We consider the problem of inferring the source of a rumor in a given large network. We assume that the rumor propagates in the network through a discrete time susceptible-infected model. Input to our problem includes ...
  • Feedback influences discriminability and attractiveness components of probability weighting in descriptive choice under risk 
    Goyal, Shruti; Miyapuram, Krishna Prasad (Frontiers Media, 2019-04)
    Our understanding of the decisions made under scenarios where both descriptive and experience-based information are available is very limited. Underweighting of small probabilities was observed in the gain domain when both ...
  • Frugal bribery in voting 
    Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2017-05)
    Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $Bribery problem, namely, Frugal-bribery and Frugal-$bribery where the ...
  • Fully dynamic maximal matching in O(log N) update time 
    Baswana, Surender; Gupta, Manoj; Sen, Sandeep (Society for Industrial and Applied Mathematics, 2018-01)
    We present an algorithm for maintaining a maximal matching in a graph under addition and deletion of edges. Our algorithm is randomized and it takes expected amortized O(log n) time for each edge update, where n is the ...
  • Generation and evaluation of privacy preserving synthetic health data 
    Yale, Andrew; Dash, Saloni; Dutta, Ritik; Guyon, Isabelle; Pavao, Adrien; Bennett, Kristin P. (Elsevier, 2020-04)
    We develop metrics for measuring the quality of synthetic health data for both education and research. We use novel and existing metrics to capture a synthetic dataset�s resemblance, privacy, utility and footprint. Using ...
  • Geographically Secured SSL-VPN Using GPS 
    Patel, Dhiren R.; Limkar, Suresh (Foundation of Computer Science, 2010-09)
    We are moving towards an era where location information will be necessary for access control. The use of location information can be used for enhancing the security of an application, for critical applications, such as the ...
  • Improved indifferentiability security bound for the JH mode 
    Moody, Dustin; Paul, Souradyuti; Smith-Tone, Daniel (Springer, 2016-05)
    Indifferentiability security of a hash mode of operation guarantees the mode's resistance against all generic attacks. It is also useful to establish the security of protocols that use hash functions as random functions. ...
  • Improved linear embeddings via Lagrange duality 
    Sheth, Kshiteej; Garg, Dinesh; Dasgupta, Anirban (Springer, 2019-03)
    Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for ...
  • Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier 
    Moody, Dustin; Paul, Souradyuti; Smith-Tone, Daniel (De Gruyter, 2016-04)
    A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them ...
  • The isomorphism problem for k-trees is complete for logspace 
    Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian (Elsevier, 2012-08)
    We show that, for k constant, k -tree isomorphism can be decided in logarithmic space by giving an View the MathML sourceO(klogn) space canonical labeling algorithm. The algorithm computes a unique tree decomposition, ...
  • Kernelization complexity of possible winner and coalitional manipulation problems in voting 
    Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2016-02)
    In the Possible winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences ...
  • Log-Space Algorithms for Paths and Matchings in k-Trees 
    Das, Bireswar; Datta, Samir; Prajakta, Nimbhorkar (Springer Link, 2013-05)
    Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 (Jakoby and Tantau in Proceedings of FSTTCS’07: The 27th Annual Conference on Foundations of ...
  • MSP-N: multiple selection procedure with 'N' possible growth mechanisms 
    Pandey, Pradumn Kumar; Singh, Mayank (Public Library of Science, 2019)
  • A multistep priority-based ranking for top-N recommendation using social and tag information 
    Banerjee, Suman; Banjare, Pratik; Pal, Bithika; Jenamani, Mamata (Springer, 2020-08)
    Recommender system is a collection of information retrieval tools and techniques used for recommending items to users based on their choices. For improving recommendation accuracy, the use of extra information (e.g., social, ...
  • Neuralcompression: a machine learning approach to compress high frequency measurements in smart grid 
    Das, Laya; Garg, Dinesh; Srinivasan, Babji (Elsevier, 2019-09)
  • On NC algorithms for problems on bounded rank-width graphs 
    Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I (Elsevier, 2018-11)
    In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least
  • On structural parameterizations of firefighting 
    Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya (Elsevier, 2019-03)
    he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step, a firefighter permanently defends (protects) an unburned vertex, and the fire then spreads to all ...
  • Parameterized algorithms for conflict-free colorings of graphs 
    Reddy, I. Vinod (Elsevier, 2018-05)
    In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...
  • Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers 
    Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2019-04)
    Approval voting provides an opportunity for the agents to make a comment about every candidate, without incurring the overhead of determining a full ranking on the entire set of candidates. This makes approval voting a ...
  • Polynomial-time algorithm for isomorphism of graphs with clique-width at most three 
    Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Elsevier, 2020-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. We give a polynomial time graph isomorphism ...

Search Digital Repository


Browse

My Account