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 53489 for “"algorithms"”.
-
Scalable clustering algorithms
Scalable clustering algorithms that can work with a wide variety of distance measures and also incorporate application specific requirements are critically important for modern day data analysis and predictive modeling. In this thesis, we propose and analyze a large class of such algorithms, …
-
Implementing genetic algorithms
… for the efficient implementation of genetic algorithms. Design philosophy, algorithms, and particulars of the implementation are discussed and a performance comparison with an existing system (GENESIS) is presented.</p>
-
Accelerating Computational Algorithms
… to exploit it are expanding the range of algorithms that can be explored on affordable commodity hardware. We will discuss the complexities that have prevented researchers from exploiting advanced hardware as well as the obstacles that remain for the non-computer scientist.
-
Materialized View Algorithms
… in a data warehouse. Several static and dynamic algorithms for selecting materialized aggregate views (MAV) in a data warehouse are proposed in this thesis. The algorithms are then compared by running a simulation system, which can be configured to compare several algorithms on different type of …
-
LATTICE REDUCTION ALGORITHMS
… later help us in understanding lattice reduction algorithms. We discuss two latticeproblems: the shortest vector problem and the closest vector problem. Then we introducetwo types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensionsand the LLL Algortihm. We illustrate how …
-
Cell exclusion algorithms
… is that of minimizing cost. Cell exclusion algorithms apply an exclusion condition to some region, e.g., a cell, in which we expect all zeros to be found or on which we wish to determine the global minimum. Since an exclusion condition is a necessary but not sufficient condition for a cell …
-
Robust clustering algorithms
… clustering is agglomerative clustering. Such algorithms have been long used across any different fields ranging from computational biology to social sciences to computer vision in part because they are simple and their output is easy to interpret. However, many of these algorithms lack any …
-
L2 Minimal Algorithms
… (commutative, real) "matrix multiplication algorithms" or "bilinear algorithms." We explain how an algorithm's L2 minimal form might be thought of as optimally stable and as close to attaining the nuclear norm as possible. We demonstrate an algorithm "Strop" that has minimum L2 norm among …
-
Decentralized Network Algorithms
… the performance of several piece selection algorithms, and also develop algorithms that ensure efficient dissemination of all pieces to all users.
-
Fast geometric algorithms
… includes sorting and selection, convex hull algorithms, the L₁ hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L₁ diameter of a set of points, the metric traveling salesman problem, and finding the superrange of starshaped and monotone polygons. The …
Page 1 of 2675