Browsing Computer Science and Automation (CSA) by Title
Now showing items 56-75 of 351
-
Cluster Identification : Topic Models, Matrix Factorization And Concept Association Networks
(2013-09-17)The problem of identifying clusters arising in the context of topic models and related approaches is important in the area of machine learning. The problem concerning traversals on Concept Association Networks is of great ... -
Comparative Analysis of Topological Structures
Measuring scientific processes result in a set of scalar functions (scalar fields) which may be related temporally, be part of an ensemble, or unrelated. Overall understanding and visualization of scientific processes ... -
Compilation of Graph Algorithms for Hybrid, Cross-Platform and Distributed Architectures
(2018-07-09)1. Main Contributions made by the supplicant: This thesis proposes an Open Computing Language (OpenCL) framework to address the challenges of implementation of graph algorithms on parallel architectures and large scale ... -
A Compiler and Symbolic Debugger for Occam
(Indian Institute of Science, 2005-03-03)We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient ... -
Compiler Assisted Energy Management For Sensor Network Nodes
(2010-08-16)Emerging low power, embedded, wireless sensor devices are useful for wide range of applications, yet have very limited processing storage and especially energy resources. Sensor networks have a wide variety of applications ... -
Compiler Transformations For Improving The Performance Of Software Transactional Memory
(2013-03-27)Expressing synchronization using traditional lock based primitives has been found to be both error-prone and restrictive. Hence there has been considerable research work to develop scalable and programmer-friendly alternatives ... -
Compiler-Assisted Energy Optimization For Clustered VLIW Processors
(2010-04-13)Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by ... -
Computational And Combinatorial Problems On Some Geometric Proximity Graphs
(2017-05-24)In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity graphs. Delaunay and Gabriel graphs are widely studied geometric proximity structures. These graphs have been ... -
Computational Problems In Codes On Graphs
(2009-05-11)Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ... -
Computational Protein Structure Analysis : Kernel And Spectral Methods
(2010-08-24)The focus of this thesis is to develop computational techniques for analysis of protein structures. We model protein structures as points in 3-dimensional space which in turn are modeled as weighted graphs. The problem of ... -
Computing Contour Tress for 2D Piecewise Polynomial Functions
Contour trees are extensively used in scalar field analysis. The contour tree is a data structure that tracks the evolution of level set topology in a scalar field. Scalar fields are typically available as samples at ... -
Concurrency Analysis and Mining Techniques for APIs
(2018-06-13)Software components expose Application Programming Interfaces (APIs) as a means to access their functionality, and facilitate reuse. Developers use APIs supplied by programming languages to access the core data structures ... -
Conflict-Tolerant Features
(2010-12-07)Large, software intensive systems are typically developed using a feature oriented development paradigm in which feature specifications are derived from domain requirements and features are implemented to satisfy such ... -
Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model
(2018-01-01)Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is often required in computer vision problems that ... -
Constant-rate Non-malleable Codes and their Applications
Non-malleable codes(NMC) introduced by Dziembowski, Pietrzak and Wichs in ITCS 2010, provide powerful security guarantees where error-correcting codes can not provide any guarantee: a decoding of tampered codeword is ... -
Constructing Provably Secure Identity-Based Signature Schemes
(2018-04-03)An identity-based cryptosystem (IBC) is a public-key system where the public key can be represented by any arbitrary string such as an e-mail address. The notion was introduced by Shamir with the primary goal of simplifying ... -
Construction of Secure and Efficient Private Set Intersection Protocol
(2018-03-17)Private set intersection(PSI) is a two party protocol where both parties possess a private set and at the end of the protocol, one party (client) learns the intersection while other party (server) learns nothing. Motivated ... -
A Context-Aware Neural Approach for Explainable Citation Link Prediction
Citations have become an integral part of scientific publications. They play a crucial role in supporting authors’ claims throughout a scientific paper. However, citing related work is a challenging and laborious task, ...