Browsing Department of Computational and Data Sciences (CDS) by thesis submitted date"2016"
Now showing items 1-12 of 12
-
Balancing Money and Time for OLAP Queries on Cloud Databases
(2017-12-16)Enterprise Database Management Systems (DBMSs) have to contend with resource-intensive and time-varying workloads, making them well-suited candidates for migration to cloud plat-forms { specifically, they can dynamically ... -
Dynamic hybrid partitioned non partitioned queue configurations based on workloads in supercomputer systems
Supercomputers rely on batch queues to manage parallel job execution, with commercial schedulers offering configurable parameters that influence job routing, execution order, and queue visitation. However, selecting an ... -
Efficient betweenness Centrality Computations on Hybrid CPU-GPU Systems
(2017-10-11)Analysis of networks is quite interesting, because they can be interpreted for several purposes. Various features require different metrics to measure and interpret them. Measuring the relative importance of each vertex ... -
Efficient parallel algorithms to compute A sub-complex of the weighted delaunay triangulation for molecular data
In the field of bio-molecules, it is utmost important to study the behaviour of a molecule while interacting with another. This interaction decides the functionality of the molecule. It is widely accepted fact that the ... -
Efficient quantum dynamics simulations for periodic potentials
Quantum algorithms are designed to efficiently solve many problems that are thought to be difficult classically. A specific case is the efficient simulation of time evolution of quantum systems. This work provides a ... -
Image Representation using Attribute-Graphs
(2017-12-13)In a digital world of Flickr, Picasa and Google Images, developing a semantic image represen-tation has become a vital problem. Image processing and computer vision researchers to date, have used several di erent representations ... -
Similarity between Scalar Fields
(2017-10-05)Scientific phenomena are often studied through collections of related scalar fields such as data generated by simulation experiments that are parameter or time dependent . Exploration of such data requires robust measures ... -
Some Algebraic Aspects Of Graph Similarity Algorithms
We proposed singular values-based sensitivity analysis and self-similarity studies to compare graph-isomorphism algorithms. SimRank method is found to be an application of power method and is not sensitive to noise in any ... -
Spectrum Sensing Receivers for Cognitive Radio
(2018-02-16)Cognitive radios require spectral occupancy information in a given location, to avoid any interference with the existing licensed users. This is achieved by spectrum sensing. Existing narrowband, serial spectrum sensors ... -
Towards Designing PCM-Conscious Database Systems
Phase Change Memory (PCM) is a recently developed non-volatile memory technology that is expected to provide an attractive combination of the best features of conventional disks (persistence, capacity) and of DRAM (access ... -
Visual Flow Analysis and Saliency Prediction
(2017-12-16)Nowadays, we have millions of cameras in public places such as traffic junctions, railway stations etc., and capturing video data round the clock. This humongous data has resulted in an increased need for automation of ...