Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 60 for “"time and space complexity"”.
-
Time and space complexity of rule-based graph programs
This thesis concerns the time and space efficiency of programs in GP 2, a rule-based graph transformation language that facilitates formal program analysis. Such programs are a sequence of control structures in which rules are called. A rule describes how part of a host graph is changed to another …
-
Models of 2D-scene complexity : a look at the intrinsic complexity of scenes
The worst-case time and space complexity of many algorithms in computational geometry is high when expressed as a function of the input size. This can make algorithms seem inefficient in general. Usually, however, the algorithm will not run with identical times on every input of a given size. …
-
Scalable Detection and Extraction of Data in Lists in OCRed Text for Ontology Population Using Semi-Supervised and Unsupervised Active Wrapper Induction
… useful information. As one example, the thousands of family history books scanned, OCRed, and placed on-line by FamilySearch.org probably contain hundreds of millions of fact assertions about people, places, family relationships, and life events. Data like this cannot be fully utilized until a …
-
Shapes and implementations in three-dimensional geometry
… is in its abstract form a finite point set in space, and it is often useful or required to compute what one might call the ""shape"" of the set. For that purpose, this thesis deals with the formal notion of the family of alpha shapes of a finite point set in three-dimensional space. Each shape …
-
Computer vision using shape spaces / Burzin Bhavnagri.
… pertaining to the physical structure of a camera and the scattering of light from visible surfaces. A sufficient condition to detect occlusions, intensity discontinuities, discontinuities in derivatives of intensity, surface discontinuities and discontinuities in derivatives of surfaces are given. …
-
Filling contours on the linear quadtree domain by insertion and traversal
… with existing LQT filling algorithms both in time and space complexity. The technique avoids explicit sorting of the input pixels or output cells by location code, and no condensation of cells is required. Traversing the regular quadtree in preorder generates the sorted output cells as an LQT.
-
An improved implementation of sparsity detection of sparse derivative matrices
… matrix for a large problem is complicated and highly error-prone. The main motivation of this research is to propose an efficient algorithm which can effectively detect and represent sparsity of unknown Jacobian matrices. Automated sparsity detection algorithms find an optimal or …
-
Supervised manifold distance segmentation
In this paper, I will propose a simple and robust method for image and volume data segmentation based on manifold distance metrics. In this approach, pixels in an image are not considered as points with color values arranged in a grid. In this way, a new data set is built by a transform function …
-
A Novel Vulnerable Smart Contracts Profiling Method Based on Advanced Genetic Algorithm Using Penalty Fitness Function
… SC vulnerabilities typically lack accuracy and effectiveness, struggling to detect complex vulnerabilities due to limited data availability. This study introduces a novel approach to detecting and profiling SC vulnerabilities, featuring two components: a new analyzer named BCCC-SCsVulLyzer …
-
An Empirical Study of Alias Analysis Techniques
As software projects become larger and more complex, software optimization at that scale is only feasible through automated means. One such component of software optimization is alias analysis, which attempts to determine which variables in a program refer to the same area in memory, and is used to …
-
A GPU accelerated RNA-RNA interaction program
… is important in processes like gene regulation, and is known to play roles in diseases including cancer and Alzheimer's. Large RRI computations run for days, weeks or even months, because the algorithms have time and space complexity of, respectively, O(N3M3) and O(N2M2), for sequences length N …
-
Adaptive edge-based prediction for lossless image compression
… method, separately studying each and suggesting new techniques.;In the prediction module, proposed Edge-Based-Predictor (EBP) and Least-Squares-Edge-Based-Predictor (LS-EBP) emphasizes on image edges and make predictions accordingly. EBP is a gradient based nonlinear adaptive …
-
Novel algorithms for optimal triangulation and polygonization of planar point sets
… Compact Triangulation (iGCT). We prove that the time and space complexity of our algorithm are O(n^4) and O(n^3) respectively. We also demonstrate that GCT approximates MWT to within a constant factor in a variety of point set configurations, including ones where other important triangulations …
-
Shelfaware: Accelerating Collaborative Awareness with Shelf CRDT
… teams to work together effectively in real-time while in different locations. In order for a user to communicate their intention to several distributed peers, computing devices must exchange high-frequency updates with transient metadata like mouse position, text range highlights, and …
-
Edge Computing Targeted Data Profiling for Assessing the Quality of Sensor Data
… the data quality of sensor data is determined and if it could be determined efficiently via a framework deployed on an edge computing device. The purpose of this was to enable data quality assessment to be done locally or close to the source of sensor data, i.e., utilize edge computing, in …
-
Efficient Software and Algorithms for the Representation and Analysis of Neural Data
… neural recordings consisting of hundreds to thousands of channels. As the pace of these developments continues to grow rapidly, it is imperative to have fast, flexible tools supporting the analysis of neural data gathered by such large scale modalities. Here we introduce the nelpy …
-
Improved algorithmic efficiency within pattern analysis and text mining of DNA sequences
The study of data strings and its application to the processing, analysis and indexing of DNA data is an increasingly valuable area of research. This particular piece of research looks into multiple structures within data strings, and explores a related problem with the aim of reducing the time and …
-
Mathematical Software for Multiobjective Optimization Problems
… surrogate modeling, trust region methods, and adaptive weighting. The result is a numerical software package that finds approximately Pareto optimal solutions that are evenly distributed across the Pareto front, using minimal cost function evaluations. The second problem of interest is the …
-
ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion
… programs can be difficult to precisely detect, and doing so manually can often prove unsuccessful. Task parallel programming models can help reduce defects introduced by the programmer by restricting concurrent functionalities to fork-join operations. Typical data race detection algorithms …
-
Scheduling periodic-time-critical tasks on multiprocessor computing systems /
The problem of allocating a set of periodic-time-critical tasks to processors in a multiprocessor system is considered. A periodic-time-critical task consists of a certain number of requests, arising periodically, each of which has a prescribed deadline. The allocation problem is to use a minimum …
Page 1 of 3