• Early structural biomarkers in dementia: mild cognitive impairment and Alzheimer’s disease 

  Shiraguppi, Bharatesh Rayappa; Miyapuram, Krishna P (2016-10-03)
• Eye movement as a predictor of cognitive ability 

  Patel, Valay Paresh (Indian Institute of Technology Gandhinagar, 2017)

  With aging population, neurodegenerative disorder is becoming a public health issue. Given the adverse effects of such disorder, tools for early screening become very critical. Early screening may help to detect such ...
• Distributed estimation in sparse heterogeneous networks 

  Kumar, Kalyankar Shravan (Indian Institute of Technology Gandhinagar, 2017)

  Advances in wireless communication and adaptive signal processing has resulted in increased interest in multidimensional sensor systems. The most popular form of multidimensional sensor system is the wireless sensor network ...
• Visual object perception problems in computer vision 

  Vora, Aditya Narendrabhai (Indian Institute of Technology Gandhinagar, 2017)

  Video object segmentation is the task of estimating foreground object segments from the background throughout video. We propose a frame-by-frame approach for video object segmentation that uses cluster information in order ...
• Parameterized algorithms for conflict-free colorings of graphs 

  Reddy, I. Vinod (Cornell University Library, 2017-09)

  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 ...
• Rack level scheduling for containerized workloads 

  Xu, Qiumin; Malladi, Krishna T.; Awasthi, Manu (2017-08-07)

  High performance SSDs have become ubiquitous in warehouse scale computing. Increased adoptions can be attributed to their high bandwidth, low latency and excellent random I/O performance. Owing to this high performance, ...
• Latent space embedding for retrieval in question-answer archives 

  Padmanabhan, Deepak; Garg, Dinesh; Shevade, Shirish (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. ...
• The parameterized complexity of happy colorings 

  Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-08)

  Consider a graph G=(V,E) and a coloring c of vertices with colors from [ℓ]. A vertex v is said to be happy with respect to c if c(v)=c(u) for all neighbors u of v. Further, an edge (u,v) is happy if c(u)=c(v). Given a ...
• Semi-supervised automatic generation of Wikipedia articles for named entities 

  Pochampally, Y.; Karlapalem, Kamalakar; Yarrabelly, N. (Association for the Advancement of Artificial Intelligence, 5/17/2016)

  We investigate the automatic generation of Wikipedia articles as an alternative to its manual creation. We propose a framework for creating a Wikipedia article for a named entity which not only looks similar to other ...
• Improved algorithm for dynamic b-matching 

  Bhattacharya, Sayan; Gupta, Manoj; Mohan, Divyarthi (9/4/2017)

  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 ...
• Manipulating Gale-Shapley algorithm: preserving stability and remaining inconspicuous 

  Vaish, Rohit; Garg, Dinesh (8/19/2017)
• Multiple source dual fault tolerant BFS trees 

  Gupta, Manoj; Khan, Shahbaz (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 7/10/2017)

  Let G=(V,E) be a graph with n vertices and m edges, with a designated set of sigma sources S subseteq V. The fault tolerant subgraph for any graph problem maintains a sparse subgraph H=(V,E') of G with E' subseteq E, such ...
• Saving critical nodes with firefighters is FPT 

  Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 7/10/2017)

  We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and ...
• Saving critical nodes with firefighters is FPT 

  Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Cornell University Library, 2017-05)
• Performance analysis of containerized applications on local and remote storage 

  Xu, Qiumin; Awasthi, Manu; Malladi, Krishna T.; Bhimani, Janki; Yang, Jingpei; Annavaram, Murali (2017-05-15)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers 

  Dey, Palash; Misra, Neeldhara; Narahari, Y. (2017-05-08)
• Multiple source dual fault tolerant BFS trees 

  Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2017-04)
• Caching with dual costs 

  Dasgupta, Anirban; Kumar, Ravi; Sarlós, Tamás (2017-04-03)
• Relation of agglomerative clustering and topic mapping on neuro-imaging data 

  Sinha, Sujata; Miyapuram, Krishna Prasad (IISER Kolkata, 2016-01-09)
• A sparse nonlinear classifier design using AUC optimization 

  Kakkar, Vishal; Shevade, Shirish Krishnaj; Sundararajan, S.; Garg, Dinesh (SIAM, 2017-04-27)

View more