Pointer analysis is one of the key static analyses during compilation. The efficiency of several compiler optimizations and transformations depends directly on the scalability and precision of the underlying pointer analysis. ...

Study of complex networks by researchers from many disciplines has provided penetrating insights on various complex systems. A study of the world wide web from a network theoretic perspective has led to the design of new ...

Text summarization is the task of generating a shortened version of the original text where core ideas of the original text are retained. In this work, we focus on query focused summarization. The task is to generate the ...

Data from present day scientific simulations and observations of physical processes often consist of multiple scalar fields. It is important to study the interactions between the fields to understand the underlying phenomena. ...

With increasing demand for social network based activities, it is very important to understand not only the structural properties of social networks but also how social networks form, to better exploit their promise and ...

Presently, most spacecraft are controlled from ground involving activities such as up-linking the schedule of daily operations and monitoring health parameters. These activities lead to a cognitive overload on human ...

Reliability modelling of RAID storage systems with its various components such as RAID controllers, enclosures, expanders, interconnects and disks is important from a storage system designer's point of view. A model that ...

Global warming is currently a major challenge facing the world. There are widespread ongoing efforts in the form of summits, conferences, etc., to find satisfactory ways of surmounting this challenge. The basic objective ...

The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...

The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]: For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast ...