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 18 of 18 for “"INDEX SPACE"”.
-
Δρομολόγηση φωλιασμένων βρόχων με τη χρήση μεθόδων υπολογιστικής γεωμετρίας
… focusing onto the geometric properties of the index space and the dependence vectors of the problem. Initially, a new algorithm for mapping onto distributed memory architectures is presented. The followed technique is based on mapping onto systolic arrays. After the index space transformation …
-
Automatic dynamic relevance determination for Gaussian process regression with multidimensional functional inputs
… framework for Gaussian process regression with index-varying functional inputs offers a way to identify relevance of the input over the index space using different weight functions. Relevance varies over the input index space in a way that results in smooth relevance profiles learned from data. …
-
Compressed indexing data structures for biological sequences
… searching within text collections (a.k.a. text indexing) becomes more and more important. This thesis introduces three different indexing data structures which focus on utilizing the similarity characteristic in biological sequences to improve performance and reduce space usage. The first topic …
-
ΑΥΤΟΜΑΤΗ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗ ΣΕΙΡΙΑΚΩΝ ΑΛΓΟΡΙΘΜΩΝ
… OF DEPENDENCE VECTORS AND THE DIMENSION OF THE INDEX SPACE. FOR 2 - DIMENSIONAL AND 3 - DIMENSIONAL INDEX SPACES, ALGORITHMS WITH POLYNOMIAL TIME COMPLEXITY IN THE NUMBER OF DEPENDENCE VECTORS ARE PROPOSED. THESE ALGORITHMS ACTUALLY SOLVE THE OPTIMAL LINEAR SCHEDULE PROBLEM FOR FAMILIES OF …
-
Pillar-array Based Two-dimensional Photonic Crystal Cavities: A New Paradigm for Optical Sensing
… having a large and connected low dielectric index space (normally air space), exhibiting a large band gap for transverse magnetic modes, having a large percent of electric field energy in air and standing on a substrate. These properties make them well suitable for applications such as …
-
A resource constrained loop pipelining technique for perfectly-nested loop structures.
… a linear transformation to the nested loop index space to ensure a cycle-free innermost loop, which is then pipelined using modulo scheduling for a known set of resources. The transformation guarantees that the target machine's available resources are the only limit to the amount of …
-
Towards Efficient Shortest Path Related-Queries on Large-Scale Graphs
… state-of-the-art approach leverages index to speed up the query processing. However, this approach incurs not only significant space overheads but also prohibitive indexing time, which makes it inapplicable to handle such queries on large graphs. Motivated by this, this thesis aims to …
-
Automatic relevance determination for Gaussian process regression with functional inputs
… relevance varies smoothly over the input index space resulting in smooth and parsimonious relevance profiles learned from data whose posterior can be inspected for scientific interpretation and used in downstream analyses. An ADRD model requires us to specify a weight function form that is …
-
A Novel GPU Algorithm for Indexing Columnar Databases with Column Imprints
… of specially designed data structures, called indexes, that can help avoid exhaustively searching the entire database. However, existing indexing techniques for CDBMS like bitmaps, zonemaps etc. have been shown to result in large storage overhead and memory traffic between storage and CPU. …
-
Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications
… locality-sensitive hashing (LSH) and graph indexes provide effective solutions for standard metrics, high-dimensional search remains challenging when the target distance is non-Euclidean, expensive to compute, or specified only at query time. This dissertation studies ANNS for multiple …
-
Indexing without invariants in model-based object recognition
… 2D images by the use of a novel, probabilistic indexing technique. Indexing is a two-stage process that includes an offline training stage and a runtime lookup stage. During training, feature vectors representing object appearance are acquired from several points of view about each object and …
-
A spatial grammar of Kubulau Fijian
… and the different aspects of grammar which index space. The Oceanic subgroup of Austronesian has been an area of particular focus in the tradition of spatial language research, and these chapters document the elements of spatial language which have received the most attention in the …
-
Approximate similarity search in high dimensional spaces: solutions, evaluations and applications
… as finding the exact answers in high dimensional spaces is costly, and brute-force linear scan is empirically the best exact similarity search method with linear space and time cost. However, the curse of dimensionality can be alleviated by sacrificing the quality of the returned answers (e.g., …
-
On optimizing data locality for data-intensive parallel workloads: a compile-time framework for machine learning models and a run-time abstraction for task-based systems
… heterogeneous data across the distinct memory spaces of CPUs (using e.g. NumPy) and GPUs (using e.g. CuPy). CrossPy solves this by providing a unified, shared index space over physically partitioned arrays. It integrates directly with the Parla scheduler to enable inter-task data locality by …
-
ALGORITHMS AND DATA STRUCTURES FOR INDEXING, QUERYING, AND ANALYZING LARGE COLLECTIONS OF SEQUENCING DATA IN THE PRESENCE OR ABSENCE OF A REFERENCE
… how do we design memory-efficient structures for indexing and querying this data. This challenge is not limited to only raw sequencing data (i.e. reads) but also to the growing collection of reference sequences (genomes, and genes) that are assembled from this raw data. We have developed new data …
-
Mapping loop-based programs onto a multithreaded processor
… follow the dependency vector over the index space and discover the different hyperplanes per cycle. This novel idea gave birth to our first run-time algorithm: The fixed-size algorithm. It has the ability to apply the hyperplane idea, discovered while running the actual computation …
-
Συστήματα παράλληλης επεξεργασίας
The evolution of computer technology has been rapid over the past two decades. Equally striking, however, is the increase of needs in computing power. To meet the demanding and lengthy algorithms we introduce parallel processing. Parallel processing has been used for many years, mainly in the field …
-
ΑΠΕΙΚΟΝΙΣΗ ΔΟΜΩΝ ΛΟΓΙΣΜΙΚΟΥ ΣΕ ΕΝΑΛΛΑΚΤΙΚΕΣ ΑΡΧΙΤΕΚΤΟΝΙΚΕΣ ΔΙΑΤΑΞΕΩΝ ΕΠΕΞΕΡΓΑΣΤΩΝ
Η ΔΙΑΤΡΙΒΗ ΠΡΑΓΜΑΤΕΥΕΤΑΙ ΤΟ ΠΡΟΒΛΗΜΑ ΤΗΣ ΑΠΕΙΚΟΝΙΣΗΣ ΑΛΓΟΡΙΘΜΩΝ ΣΕ ΔΙΑΤΑΞΕΙΣ ΕΠΕΞΕΡΓΑΣΤΩΝ ΚΑΙ ΠΡΟΤΕΙΝΟΝΤΑΙ ΝΕΕΣ ΤΕΧΝΙΚΕΣ ΓΙΑ ΤΗΝ ΑΝΤΙΜΕΤΩΠΙΣΗ ΤΟΥ. ΟΙ ΠΡΟΤΕΙΝΟΜΕΝΕΣ ΜΕΘΟΔΟΙ ΕΦΑΡΜΟΖΟΝΤΑΙ ΣΕ ΑΛΓΟΡΙΘΜΟΥΣ ΕΚΦΡΑΣΜΕΝΟΥΣ ΜΕ ΤΗ ΜΟΡΦΗ ΒΡΟΧΩΝ.ΑΡΧΙΚΑ, ΜΕΛΕΤΩΝΤΑΙ ΑΛΓΟΡΙΘΜΟΙ ΜΕ ΣΤΑΘΕΡΕΣ ΕΞΑΡΤΗΣΕΙΣ ΚΑΙ …