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 16 of 16 for “"Family of Problems"”.
-
On the Discrete Number of Tree Graphs
We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible …
-
Language style transfer
This thesis studies style transfer on the basis of non-parallel text. This is an instance of a broad family of problems including machine translation, decipherment, and attribute modication. The key challenge is to separate the content from style in an unsupervised manner. We assume a shared latent …
-
A Comparative Analysis Between Context-based Reasoning (cxbr) And Contextual Graphs (cxgs).
… Contextual Graphs (CxGs) involve the modeling of human behavior in autonomous and decision-support situations in which optimal human decision-making is of utmost importance. Both formalisms use the notion of contexts to allow the implementation of intelligent agents equipped with a context …
-
Exploiting chordal structure in systems of polynomial equations
… whether chordality might also help solve systems of polynomials. We propose a new technique, which we refer to as chordal elimination, that relies in elimination theory and Gröbner bases. Chordal elimination can be seen as a generalization of sparse linear algebra. Unlike the linear case, the …
-
OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY
In this thesis, we explore optimisation problems related to security, focusing on real-world systems that can be modelled using graphs or binary matrices. The first problem we examine is the Weighted Safe Set Problem, a graph optimisation problem that seeks to identify vertex partitions satisfying …
-
Scaling Multidimensional Inference for Big Structured Data
… information technology, big data is a collection of data sets so large and complex that it becomes difficult to process using traditional data processing applications" [151]. In a</p><p>world of increasing sensor modalities, cheaper storage, and more data oriented questions, we are quickly passing …
-
Classification in the Presence of Ordered Classes and Weighted Evaluative Attributes
We are interested in an important family of problems in the interface of the Multi-Attribute Decision-Making and Data Mining fields. This is a special case of the general classification problem, in which records describing entities of interest have been expressed in terms of a number of evaluative …
-
Optimal resource allocation In base stations for mobile wireless communications
Telecommunications provides a rich source of interesting and often challenging optimisation problems. This thesis is concerned with a series of mixed-integer non-linear optimisation problems that arise in mobile wireless communications systems. The problems under consideration arise when mobile …
-
Extremal Problems for Partitions of Edge Sets of Graphs
This thesis considers three families of problems in graph theory about partitions of the edge sets of graphs (also known as graph decompositions). The first family we address consists of induced Ramsey number problems. Induced Ramsey numbers generalize ordinary Ramsey numbers. The induced Ramsey …
-
Approximation algorithms for stochastic scheduling on unrelated machines
Motivated by problems in distributed computing, this thesis presents the first nontrivial polynomial time approximation algorithms for an important class of machine scheduling problems. We study the family of preemptive minimum makespan scheduling problems where jobs have stochastic processing …
-
Linear and ellipsoidal pattern separation: theoretical aspects and experimental analysis
… (a separating surface) from a set or sequence of observations. This classifier would later be used to discern observations of different types. In this work, the classification problem is viewed from the perspective of the optimization theory: we suggest an optimization problem for the learning …
-
Decomposition methods for large scale stochastic and robust optimization problems
… decomposition methods for use on broad families of stochastic and robust optimization problems in order to yield tractable approaches for large-scale real world application. We introduce a new type of a Markov decision problem named the Generalized Rest less Bandits Problem that encompasses a …
-
ROLAND : a tool for the realistic optimisation of local access network design
… access network represents between 50% and 70% of capital investment of a telecommunications company. This thesis investigates algorithms that can be used to design economical access networks and presents ROLAND: a tool that incorporates several of these algorithms into an interactive …
-
Definition of a Method for the Formulation of Problems to be Solved with High Performance Computing
… been continuously increasing, however today’s problems are larger and more complex and demand even more computational power. Interest in computational problems has also been increasing and is an important research area in computer science. These complex problems are solved with computational …
-
Reliable Inference from Unreliable Agents
… using multiple sensors has been an active area of research since the emergence of wireless sensor networks (WSNs). Several researchers have addressed the design issues to ensure optimal inference performance in such networks. The central goal of this thesis is to analyze distributed inference …
-
The complexity of joint computation
… the power and, especially, the limits of efficient joint computation, in several computational models: query algorithms, circuits, and Turing machines. We significantly improve and extend past results on limits to efficient joint computation for multiple independent tasks; identify …