Computer Science and Automation (CSA): Recent submissions
Now showing items 301-320 of 378
-
A Nonlinear Stochastic Optimization Framework For RED
(2011-09-23) -
A Low-Complexity Algorithm For Intrusion Detection In A PIR-Based Wireless Sensor Network
(2011-08-25)This thesis investigates the problem of detecting an intruder in the presence of clutter in a Passive Infra-Red (PIR) based Wireless Sensor Network (WSN). As one of the major objectives in a WSN is to maximize battery life, ... -
Near-Duplicate Detection Using Instance Level Constraints
(2011-08-09)For the task of near-duplicate document detection, comparison approaches based on bag-of-words used in information retrieval community are not sufficiently accurate. This work presents novel approach when instance-level ... -
Hard Drive Failure Prediction : A Rule Based Approach
(2011-07-12)The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (self-monitoring, analysis and ... -
Discovery Of Application Workloads From Network File Traces
(2011-05-19)An understanding of Input/Output data access patterns of applications is useful in several situations. First, gaining an insight into what applications are doing with their data at a semantic level helps in designing ... -
Online Optimization Of RED Routers
(2011-04-25) -
Learning Dynamic Prices In Electronic Markets
(2011-04-19) -
Analysing Message Sequence Graph Specifications
(2011-03-29)Message Sequence Charts are a visual representation of the system specification which shows how all the participating processes are interacting with each other. Message Sequence Graphs provide modularity by easily allowing ... -
Efficient Kernel Methods For Large Scale Classification
(2011-02-22)Classification algorithms have been widely used in many application domains. Most of these domains deal with massive collection of data and hence demand classification algorithms that scale well with the size of the data ... -
Intersection Graphs Of Boxes And Cubes
(2011-01-25)A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such that for u,v V(G), (u,v) E(G) ƒ (u) ƒ (v) ≠ . Interval graphs are thus the intersection graphs ... -
Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences
(2011-01-25)In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ... -
Efficient Compilation Of Stream Programs Onto Multi-cores With Accelerators
(2010-12-30)Over the past two decades, microprocessor manufacturers have typically relied on wider issue widths and deeper pipelines to obtain performance improvements for single threaded applications. However, in the recent years, ... -
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 ... -
Boxicity, Cubicity And Vertex Cover
(2010-09-28)The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ... -
The Isoperimetric Problem On Trees And Bounded Tree Width Graphs
(2010-08-26)In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected graph. For let δ(S,G)= {(u,v) ε E : u ε S and v ε V – S }be the edge boundary ... -
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 ... -
Efficient Frequent Closed Itemset Algorithms With Applications To Stream Mining And Classification
(2010-08-24)Data mining is an area to find valid, novel, potentially useful, and ultimately understandable abstractions in a data. Frequent itemset mining is one of the important data mining approaches to find those abstractions in ...