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 48 for “"unordered"”.
-
Bad Data, Good Representations: Transferable Embeddings of Heterogeneous, Unordered, and Incomplete Datasets
… range of data types and structures. By embracing unorderedness, incompleteness, and heterogeneity not as flaws but as inherent attributes to be modeled, this work paves the way for more robust, flexible, and general-purpose neural systems.
-
Numerical Sequence Recognition: Is Familiarity or Ordinality the Primary Factor in Performance?
… types of ordered stimuli, with corresponding unordered sequences. In general, highly-skilled participants responded faster than their less-skilled counterparts. All participants were slower to reject unordered sequences that shared numbers with highly familiar sequences (e.g., 3 1 2) than with …
-
Homology of Configuration Spaces of Surfaces as Mapping Class Group Representations
… between various flavours: ordered and unordered configurations, of closed surfaces and surfaces with boundary, and with different homology coefficients. In Chapter 2, we prove a version of the scanning isomorphism that is “untwisted” and equivariant with the mapping class group action. …
-
Double-Change Covering Designs with Block Size k = 4
… of b blocks, B = {B1,B2, · · · ,Bb}, each an unordered subset of k distinct elements from [v] = {1, 2, · · · , v}, which obey: (1) each block differs from the previous block by two elements, and, (2) every unordered pair of [v] appears in at least one block. The object is to minimize b for a …
-
An approximate search engine for structure
… query tree. Rooted ordered labeled trees, rooted unordered labeled trees and free trees are considered. Ordered labeled trees are trees in which each node has a label and the left-to-right order among siblings matters. Unordered labeled trees are trees in which the parent-child relationship is …
-
Vision-Based Rendering: Using Computational Stereo to Actualize IBR View Synthesis
… an adjacency graph construction algorithm for unordered photographs, a pose estimation ordering for unordered image sets, and an image-based rendering algorithm that interpolates omnidirectional images to synthesize novel views. We encapsulate our contributions into a working system that we …
-
Ordered Mesh Network Interconnect (OMNI) : design and implementation of in-network coherence
… viable proposals to extend snoopy coherence to unordered interconnects - specifically, modular packet-switched interconnects that have emerged as a scalable solution to the communication challenges in the CMP era. This thesis proposes a distributed in-network global ordering scheme that enables …
-
Underspecification in Korean Phonology (Morphology)
… departing from the SPE view of a segment as an unordered set of all the features supplied by universal grammar. By eliminating redundant features from underlying representation and specifying only unpredictable features, underspecification system constrains possible types of phonological …
-
Effective Versions of Ramsey's Theorem
… of ($\omega\rbrack\sp{k}$ (the set of all unordered k-tuples of natural numbers) into finitely many classes, then there exists an infinite set A which is homogeneous for P; i.e., there exists $j, 1 \le j \le n,$ such that all k-tuples from A are in $C\sb{j}.$ Let H(P) denote the set of all …
-
Elektronen-Energieverlustspektroskopie von quasi-eindimensionalen Kupraten und Vanadaten
… from the charge ordered state into the unordered state at 34 K. Thcontributions of the 3d electrons to the EELS spectra of NaV2O5 are filtered by comparing these spectra with the loss functions of the structurally related V2O5 (d0 configuration). For NaV2O5 the picture of linear chains …
-
Calibration, recognition, and shape from silhouettes of stones
… the one-to-one correspondence between two unordered batches of silhouette sets of the same batch of stones. A probabilistic framework is used to combine recognition by merging (which is slow, but accurate) with the efficiency of computing shape distribution-based dissimilarity values. Two …
-
Speculative parallelism in Intel Cilk Plus
… some redundant work. One example is searching an unordered tree graph for a particular node. Each subtree can be searched in parallel by a separate thread. Once a single thread is successful, however, the work of the others is unneeded and should be ended. This type of computation is known as …
-
Exploiting syntactic relations for question answering
… algorithm to calculate the similarity between unordered, unrooted syntactic trees. The general case of this problem is NP-complete; in practice, SMARTQA demonstrates that an optimized implementation of the algorithm can be feasibly used for question answering applications.
-
DeepMVS: learning multi-view stereopsis
… for aggregating information across a set of unordered images, and (3) integrating multi-layer feature activations from the pre-trained VGG-19 network. We validate the efficacy of DeepMVS using the ETH3D Benchmark. Our results show that DeepMVS compares favorably against state-of-the-art …
-
Synchronization-avoiding graph algorithms and runtime aspects
… to eliminate barriers, we design and study unordered, data-driven graph algorithms, relying on optimistic (speculative) execution. Our design of algorithms allows work to be performed in any order, refining the result as the algorithm progresses. This flexibility in ordering facilitates …
-
Decompositions of Mixed Graphs with Partial Orientations of the P<sub>4</sub>.
… and <em>C</em> is a set of ordered and unordered pairs, denoted (<em>x</em>, <em>y</em>) and [<em>x</em>, <em>y</em>] respectively, of elements of <em>V</em> [8]. An ordered pair (<em>x</em>, <em>y</em>) ∈ <em>C</em> is called an <em>arc</em> of (<em>V</em>,<em>C</em>) and an unordered …
-
A study of Symmetric and Repetitive Structures in Image-Based Modeling
… failure in structure-from-motion, especially for unordered image collections. In this dissertation, we made a detailed survey on 3D reconstruction methodologies and proposed a novel objective function based on `missing correspondences? to evaluate the optimality of a 3D reconstruction. An …
-
Efficient Structure and Motion: Path Planning, Uncertainty and Sparsity
… the problem of sequential 3D reconstruction from unordered image sequences, resulting in increased robustness, accuracy and a reduced need for costly bundle adjustment operations. In the final paper, a method for efficient solution of bundle adjustment problems based on a junction tree …
-
The Acacia Berlandieri Species Group: Armed New World Members of Subgenus Aculeiferum (Fabaceae) With Distributions Restricted North of the Isthmus of Tehuantepec, Mexico
… the character states were assumed to be unordered, and character states were weighted equally. This resulted in 54 optimal 70-step trees in the analysis without hybrids. The presence of a unique synapomorphy (petiolar glands that are sessile or slightly raised), weakly supported monophyly …
-
Exploiting object dynamics for recognition and control
… a baseline system treating object views as an unordered stream of images.
Page 1 of 3