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 358 for “"Efficient algorithms."”.
-
Efficient Algorithms for Vector Similarities
… we study the following question: "How can we efficiently compute on large scale high dimensional data?" In this thesis, we focus on two aspects of this question. 1) Efficient local similarity computation: we give faster algorithms for individual similarity computations, such as calculating …
-
Efficient algorithms for buffer allocation
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
Efficient Algorithms for Mining Data Streams
… Mining data streams require approaches that are efficient, adaptive, and scalable. For several stream mining tasks, knowledge of the data's probability density function (PDF) is essential to deriving usable results. Providing an accurate model for the PDF benefits a variety of stream mining …
-
Efficient algorithms for phylogenetic post-analysis
… dissertation, we present novel approaches and efficient algorithms for three post-analysis tasks: taking distances between (typically, all pairs in a set of) trees, bootstrapping, and building consensus trees. For instance, it is often the case that reconstruction finds multiple plausible …
-
Efficient algorithms for new computational models
… in hardware. We provide new scheduling algorithms for this computational model. The second model is motivated by peer-to-peer networks, where countless (often inexpensive) computing devices cooperate in distributed applications without any central control. We state and analyze new …
-
Efficient algorithms for learning mixture models
… great challenges in finding statistically efficient and computationally efficient solutions. We start with a simple, yet general setup of mixture model in the first part. We study the problem of estimating a low rank M x M matrix which represents a discrete distribution over M2 outcomes, …
-
Optimization over networks: Efficient algorithms and analysis
… is focused on the development and analysis of efficient distributed algorithms for a constrained convex optimization problem over a multi-agent network where each agent has its own objective function and constraint set. We propose gradient descent algorithms with random projections which use …
-
Social computation: Fundamental limits and efficient algorithms
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2018-08-31 without embargo terms
-
Efficient Algorithms for Graph-Theoretic and Geometric Problems
… placing firefighters. We provide both new exact algorithms for the case of general graphs as well as approximation algorithms for the case of planar graphs. Next, we study drawing graphs within a given polygon in the plane. We present asymptotically tight upper and lower bounds for this problem …
-
Efficient algorithms for bipartite matching problems with preferences
… students and hospitals). We present a range of efficient algorithms for finding various types of optimal matchings in the context of these problems. Our optimality criteria involve a diverse range of concepts that are alternatives to classical stability. Examples include so-called popular and …
-
Efficient Algorithms for Querying Large and Uncertain Data
… is to preprocess input data into an index to efficiently answer queries over data. In many real applications we need to handle a large amount of data or/and data that are ambiguous because of human errors and data integration. With the data sets becoming increasingly large and complex, queries …
-
Matching in networks: fundamental limits and efficient algorithms
… noisy and vast amounts of data requires highly efficient approaches that can process a large amount of data and detect tenuous statistical signatures. As such, my thesis has developed along the following two interrelated streams. </p><p>The first stream aims at developing the fundamental limits …
-
Efficient algorithms in Coxeter groups of large type
We establish a quadratic time algorithm for the word problem and a cubic time algorithm for the conjugacy problem for Coxeter groups of large type. We also give conditions on the relators of a large-type Coxeter group that are necessary and sufficient for the group to be hyperbolic, and we give a …
-
Efficient Algorithms and Systems for Tiny Deep Learning
… than mobile phones. In this thesis, we study efficient algorithms and systems for tiny-scale deep learning. We propose MCUNet, a framework that jointly designs the efficient neural architecture (TinyNAS) and the lightweight inference engine (TinyEngine), enabling ImageNet-scale inference on …
-
Efficient Algorithms for Data Analytics in Geophysical Imaging
… with regards to data storage and performing efficient analysis. To address this, we have designed and implemented efficient algorithms for two commonly utilized techniques in geophysical imaging: cross-correlations, and multichannel analysis of surface waves (MASW). Our cross-correlation …
-
Efficient Algorithms for Mining Large Spatio-Temporal Data
… faster pace. It becomes<br />critical to design efficient algorithms for identifying novel and<br />meaningful patterns from massive spatio-temporal datasets. Different<br />from the other data sources, this data exhibits significant<br />space-time statistical dependence, and the assumption of …
-
Efficient Algorithms and Parallel Implementations for Power Series Multiplication
… multiplication. Power series multiplication algorithms working based on a prescribed precision, say $n$ (where $n$ is a natural number), take the first $n$ coefficients of the two power series as input, multiply them, and return the first $n$ coefficients of the product. While these …
-
Efficient algorithms for gene cluster detection in prokaryotic genomes
… fragmentary, and sometimes confusing. The given algorithms often lack the necessary grounds to prove their correctness, or assess their complexity. Within the first formal models of a conserved genomic neighborhood, genomes are often represented as permutations of their genes, and common …
-
Hierarchical Clustering Techniques for Energy-efficient Algorithms in WSNs
In Wireless Sensor Networks (WSNs) with large number of micro-sensor nodes, successfully receiving all the useful data with unnecessary loss of energy is a major challenge. WSNs are extremely important for many applications in civil and military domains. Despite their use in many successful …
Page 1 of 18