DR Home
→
Computer Science and Engineering
→
Browsing Computer Science and Engineering by Title

Browsing Computer Science and Engineering by Title

Now showing items 127-146 of 299

Identification, tracking and impact: understanding the trade secret of catchphrases

Jalal, Jagriti; Singh, Mayank; Pal, Arindam; Dey, Lipika; Mukherjee, Animesh (Cornell University Library, 2020-07)
Identification, tracking and impact: understanding the trade secret of catchphrases

Jalal, Jagriti; Singh, Mayank; Pal, Arindam; Dey, Lipika; Mukherjee, Animesh (2020-08-01)
Identifying medical terms related to specific diseases

Shekhar, Mihir; Chikka, Veera Ragahvendra; Thomas, Lini; Mandhan, Sunil; Karlapalem, Kamalakar (IEEE, 2015-11)
Identifying sleeping beauty authors in the scientific network

Kundu, Soumita (Indian Institute of Technology Gandhinagar, 2020)
IIT Gandhinagar at SemEval-2019 Task 3: contextual emotion detection using deep learning

Pamnani, Arik; Goel, Rajat; Choudhari, Jayesh; Singh, Mayank (2019-06)
IIT Gandhinagar at SemEval-2020 task 9: code-mixed sentiment classification using candidate sentence generation and selection

Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2020-06)
IIT Gandhinagar at SemEval-2020 task 9: code-mixed sentiment classification using candidate sentence generation and selectionIIT Gandhinagar at SemEval-2020 task 9: code-mixed sentiment classification using candidate sentence generation and selection

Srivastava, Vivek; Singh, Mayank (2020-12-12)
Imbalance parameterized by twin cover revisited

Misra, Neeldhara; Mittal, Harshil (Cornell University Library, 2020-05)

We study the problem of Imbalance parameterized by the twin cover of a graph. We show that Imbalance is XP parameterized by twin cover, and FPT when parameterized by the twin cover and the size of the largest clique outside ...
Imbalance parameterized by twin cover revisited

Misra, Neeldhara; Mittal, Harshil (29-08-20)
Impact of COVID19 lockdown on household energy consumption on two Indian cities: poster abstract

Pathak, Rachna; Agrawal, Shalu; Adhikary, Rishiraj; Batra, Nipun; Ganesan, Karthik (2020-11-16)
Improved algorithm for dynamic b-matching

Bhattacharya, Sayan; Gupta, Manoj; Mohan, Divyarthi (2018-04-09)

Recently there has been extensive work on maintaining (approximate) maximum matchings in dynamic graphs. We consider a generalisation of this problem known as the maximum b-matching: Every node v has a positive integral ...
Improved FPT algorithms for deletion to forest-like structures

Gowda, Kishen N.; Lonkar, Aditya; Panolan, Fahad; Patel, Vraj; Saurabh, Saket (Cornell University Library, 2020-09)
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 ...
Innovation and revenue: deep diving into the temporal rank-shifts of fortune 500 companies

Singh, Mayank; Pal, Arindam; Dey, Lipika; Mukherjee, Animesh (2020-01-05)
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 ...
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 ...
Latent space embedding for retrieval in question-answer archives

Padmanabhan, Deepak; Garg, Dinesh; Shevade, Shirish Krishnaj (2017-09-07)

Community-driven Question Answering (CQA) systems such as Yahoo! Answers have become valuable sources of reusable information. CQA retrieval enables usage of historical CQA archives to solve new questions posed by users. ...

Now showing items 127-146 of 299

Search Digital Repository

Browse

All of DSpace
This Community
- Titles
- Authors
- By Advisor
- By Issue Date
- Subjects
- By Type
- By Degree
- By Department

Browsing Computer Science and Engineering by Title

Browsing Computer Science and Engineering by Title

Search Digital Repository

Browse

All of DSpace

This Community

My Account