Browsing Computer Science and Automation (CSA) by Title
Now showing items 542-552 of 552
-
Variants and Generalization of Some Classical Problems in Combinatorial Geometry
(2018-02-18)In this thesis we consider extensions and generalizations of some classical problems in Combinatorial Geometry. Our work is an offshoot of four classical problems in Combinatorial Geometry. A fundamental assumption in these ... -
Variants of Hegselmann-Krause Model
(2017-12-04)The Hegselmann-Krause system (HK system for short) is one of the most popular models for the dynamics of opinion formation in multi agent systems. Agents are modeled as points in opinion space, and at every time step, each ... -
Verification of a Generative Separation Kernel
A Separation Kernel is a small specialized microkernel that provides a sand-boxed execution environment for a given set of processes (also called \subjects"). The subjects may communicate only via declared memory channels, ... -
Verification of information flow properties
Information flow properties are a way of specifying security properties of systems, that dates back to the work of Goguen and Meseguer [7] in the eighties. A system is viewed as generating traces containing “confidential” ... -
Visual Analysis Of Interactions In Multifield Scientific Data
(2014-11-14)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. ... -
Wavelets for volume graphics
In recent years, there has been a shift in the paradigm from surface-based graphics to volume graphics. Volume graphics uses a three-dimensional unit cube, known as a voxel, as its primitive, whereas surface-based graphics ... -
Weak visibility and related problems on simple polygons
Visibility and shortest path problems are two important areas of research in computational geometry. In this thesis we study weak visibility and related problems on simple polygons and propose efficient algorithms. We study ... -
Weighted Average Based Clock Synchronization Protocols For Wireless Sensor Networks
(2016-07-12)Wireless Sensor Networks (WSNs) consist of a large number of resource constrained sensor nodes equipped with various sensing devices which can monitor events in the real world. There are various applications such as ... -
Whole-Program and Non-Bare-Metal Control-Flow Attestation
Software attestation enables a remote entity to verify that a program executed as intended on an untrusted platform, with applications in domains such as embedded systems, Internet of Things (IoT), and cloud-edge computing. ... -
Zero Knowledge Proofs: Succinct Verification, Distributed Proofs and Lookup Arguments
Zero-Knowledge Proofs (ZKPs) are fundamental cryptographic tools enabling a prover to convince a verifier about the knowledge of a secret witness related to a public statement, without revealing any information beyond the ... -
Zero-Knowledge Proofs with Enhanced Deniability
In cryptography, deniability is a crucial concept that allows a participant to plausibly deny taking part in executing a scheme or protocol. Non-interactive zero-knowledge (NIZK) proofs enable a party (the prover) to ...