Search
Now showing items 111-120 of 158
Identifying Method Memoization Opportunities in Java Programs
(2017-12-13)
Memorization of a method is a commonly used re-factoring wherein developer modules the code of a method to save return values for some or all incoming parameter values. Whenever a parameter-tuple is received for the second ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
Large Scale Implementation Of The Block Lanczos Algorithm
(2010-08-16)
Large sparse matrices arise in many applications, especially in the major problems of Cryptography of factoring integers and computing discrete logarithms. We focus attention on such matrices called sieve matrices generated ...
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
(2017-12-16)
In many real world situations, especially involving multiagent systems and artificial intelligence, participating agents often need to agree upon a common alternative even if they have differing preferences over the available ...

