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 31 for “"Decomposition (Mathematics)"”.
-
Decomposing rectilinear regions into rectangles
… of rectangles. There are two different types of decomposition considered here : decomposing a figure into non-overlapping parts, called partitioning, and decomposing a figure into possibly overlapping parts, called covering. A method is outlined and proved for solving the above two problems, and …
-
Non-local Cahn-Hilliard equation
… D.)--Michigan State University. Department of Mathematics, 2005
-
New Approaches to Column Compatibility Checking and Column-Based Input/Output Encoding for Curtis Decompositions of Completely or Incompletely Specified Switching Functions
Cube calculus is an algebraic model used to process boolean functions. Cube calculus operations are widely used in logic optimization, logic synthesis, image processing and recognition, machine learning, and other applications which require massive logic operations. The cube calculus operations can …
-
Domain decomposition and high order discretization of elliptic partial differential equations
… to a recent burgeoning of research into domain decomposition algorithms. Domain decomposition is a procedure which employs subdivision of the solution domain into smaller regions of convenient size or shape and, although such partitionings have proven to be quite effective on serial computers, …
-
Topological invariants of contact structures and planar open books
… D.)--Michigan State University. Department of Mathematics, 2008
-
Autocorrelation and decomposition methods in combinational logic design
… logic synthesis approach called two-place decomposition. A new optimization technique is presented, based on the autocorrelation of switching functions, to find near-optimal variable pairings for decoded PLAs. The results of this approach compare favourably to those of other researchers’ …
-
Analysis of a nonhierarchical decomposition algorithm
… if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some …
-
Tensor generalizations of the singular value decomposition for integrative analysis of large-scale molecular biological data
… higher-order generalizations of singular value decomposition (SVD) - both the higher-order singular value decomposition (HOSVD) and Parallel Factorization (PARAFAC) - in transforming tensors into simplified spaces. I apply these transformations to a series of DNA microarray datasets from …
-
The spectral flow, the Maslov index and decompositions of manifolds
… D.)--Michigan State University. Department of Mathematics, 1994
-
A New Approach to Machine Learning Hardware Classifier Design Based on Functional Decomposition of Multi-Valued Functions
… based on combining modified Ashenhurst-Curtis Decomposition and multiplexer-based synthesis. The PSUD classifier brings three new contributions: an approach to solve the column multiplicity problem, an approach to encode multiple-valued variables, and a decomposition algorithm based on modified …
-
Approximating the circumference of 3-connected claw-free graphs
… contain two specified edges. We then use Tutte decomposition to partition the graph and then use the inductive hypothesis of our theorem to find paths or cycles in the different parts of the decomposition.
-
Effects of decomposition level on the intrarater reliability of multiattribute alternative evaluation
… multiattributed choice alternatives is judgment decomposition: the alternatives are decomposed into a number of value-relevant attributes, the decision maker evaluates each alternative with respect to each attribute, and those single-attribute evaluations are aggregated across the attributes by a …
-
Preconditioners constructed from the interpolative decomposition for the variable coefficient Poisson problem
… this coupling, an idea based on interpolative decomposition and random matrices. We find that this procedure does create an efficient preconditioner to get at the coupling between subdomains.
-
Primary decomposition of ideals in a ring
The concept of unique factorization was first recognized in the 1840s, but even then, it was still fairly believed to be automatic. The error of this assumption was exposed largely through attempts to prove Pierre de Fermat's, 1601-1665, last theorem. Once mathematicians discovered that this …
-
Primary decomposition of ideals in a ring
The concept of unique factorization was first recognized in the 1840s, but even then, it was still fairly believed to be automatic. The error of this assumption was exposed largely through attempts to prove Pierre de Fermat's, 1601-1665, last theorem. Once mathematicians discovered that this …
-
Decomposition techniques for support vector machines training and applications.
… is very large. We propose to apply the Benders Decomposition technique to the resulting LP for the regression case. In addition to this, other decomposition techniques like support clusters and bagging methods have been developed. Also, a very efficient data preprocessing method for SVM which is …
Page 1 of 2