Browsing Journal Articles by Title

Browsing Journal Articles by Title

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • Tripathi, Shrabani S.; Bhatia, Udit; Mohanty, Mohit P; Karmakar, Subhankar; Ghosh, Subimal (IOP Publishing, 2021-03)
    The evacuation of the population from flood-affected regions is a non-structural measure to mitigate flood hazards. Shelters used for this purpose usually accommodate a large number of flood evacuees for a temporary period. ...
  • 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 ...
  • 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 ...
  • Yale, Andrew; Dash, Saloni; Dutta, Ritik; Guyon, Isabelle; Pavao, Adrien; Bennett, Kristin P. (Elsevier, 2020-11)
    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 ...
  • 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 ...
  • Garg, Ankit; Huang, Yuanxu; He, Huang; Huangm, Xilong; Lin, Peng; Kalra, Kanishk; Mei, Guoxiong; Khandare, Vaibhav Dilip; Singh, Lovepreet (Wiley, 2022-05)
    With the rapidly changing needs of the construction industry and higher education, Conceive-Design-Implement-Operate (CDIO) educational framework is essential in delivering basics and practical aspects to undergraduate ...
  • Misra, Neeldhara; Mittal, Harshil (Elsevier, 2021-12)
    Imbalance is a classical graph layout problem with several applications, particularly in graph drawing. The imbalance of a layout σ is determined by how well-balanced the neighbors of the vertices are in σ. In the present ...
  • 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. ...
  • 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 ...
  • 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 ...
  • 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, ...
  • 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 ...
  • 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 ...
  • Pandey, Pradumn Kumar; Singh, Mayank (Public Library of Science, 2019)
    Network modeling is a challenging task due to non-trivial evolution dynamics. We introduce multiple-selection-procedure with ‘N’ possible growth mechanisms (MSP-N). In MSP-N, an incoming node chooses a single option among ...
  • 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, ...
  • Das, Bireswar; Sharma, Shivdutt (Springer, 2020-10)
    The isomorphism problem for groups, when the groups are given by their Cayley tables is a well-studied problem. This problem has been studied for various restricted classes of groups. Kavitha gave a linear time isomorphism ...
  • Das, Laya; Garg, Dinesh; Srinivasan, Babji (Elsevier, 2019-09)
  • Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi (Elsevier, 2022-04)
    A real-valued set function is (additively) approximately submodular if it satisfies the submodularity conditions with an additive error. Approximate submodularity arises in many settings, especially in machine learning, ...

Search Digital Repository


Browse

My Account