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 1301 for “"Efficient algorithms"”.
-
Efficient Algorithms for RDV graphs
… tree. A straightforward implementation of these algorithms would require $O(n+m)$ time. We improve their efficiency by transforming the question about the neighborhood of $v$ into a type of range query amid a set of horizontal and vertical line segments. Our algorithms run in $O(n \log{n})$ time, …
-
Efficient Algorithms for Market Equilibria
… is if computation of equilibria can be done efficiently. Moreover, the emergence of Internet and e-commerce has given rise to new markets that have completely changed the traditional notions. Add to this the pervasiveness of computing resources, and an algorithmic theory of market equilibrium …
-
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 Sorting on GPUs
… of affordable parallelism. We present an efficient sorting algorithm called Fine Sample Sort (FSS). Our FSS algorithm extends and outperforms sample sort algorithm presented by Leischner[2], which is currently the fastest known comparison based algorithm on GPUs. The performance gain of …
-
Efficient algorithms for gate matrix layout
Not available
-
Efficient algorithms in quantum query complexity
… set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition. For the Hamiltonian simulation problem, we provide a quantum algorithm with query complexity sublogarithmic in the inverse error, an …
-
Provably efficient algorithms for decentralized optimization
… efficiency of decentralized optimization algorithms. Due to the heterogeneity of local objective functions, fostering cooperation across the agents over a possibly time-varying network is challenging yet necessary to achieve fast convergence to the global optimum. Furthermore, real-world …
-
Efficient Algorithms for Clustering Polygonal Obstacles
… In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle …
-
Efficient Algorithms For Correlation Pattern Recognition
… improved performance. This dissertation develops efficient QCFs that offer significant savings in storage requirements and computational complexity over existing designs. Firstly, an adaptive algorithm is presented that is able to modify the QCF coefficients as new data is observed. Secondly, a …
-
Efficient Algorithms for Reconfigurable Antenna Systems
The main goal of this research is to develop algorithms to facilitate the use of a new type of antenna, called multifunctional reconfigurable antenna (MRA). Traditional antennas have fixed radiation properties which cannot be changed to adapt to different environments. To solve this problem, MRAs, …
-
Parallel Cache-Efficient Algorithms on GPUs
… cores, low-latency memory units, and efficient thread context switching capabilities. However, theoretical research on parallel algorithms for GPUs is challenging due to the multitude of interdependent factors influencing overall runtime. Computational models are commonly employed to …
-
Efficient algorithms for big data management
… anonymity of users and, on the other hand, are efficient in terms of time and storage space for large volumes of databases. The research results of the work focus on the following: Evaluate the performance of queries in a large volume database using or not the Bloom Filter structure. Evaluate …
-
Efficient algorithms for inverse lighting design
… - a central part of our cost function - more efficient and robust. Aside from the inverse lighting design problem, the pursue of a highly-efficient global illumination technique is important for other major computer graphics applications, such as photorealistic real-time rendering. To this …
-
Efficient algorithms for graph substructure search
Many recent applications strongly demand efficient and effective management of graph structured data such as paths, trees, and general graphs. These applications include Bioinformatics, Chemistry, Social networks, Software and Data Engineering, World Wide Web, etc. The goal of this thesis is to …
-
Efficient Algorithms for Sparse Statistical Learning
… is challenging and requires innovative algorithms to compute solutions both accurately and efficiently. This thesis presents a suite of algorithms and computational techniques for a range of sparse statistical models designed to address these challenges. These algorithms leverage the …
-
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 …
Page 1 of 66