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 9 of 9 for “"Local Algorithms"”.
-
Local Algorithms for Sparsification of Average-case Graphs
Given an input graph 𝐺, a Local Computation Algorithm for sparse spanning graphs provides query access to a sparse subgraph 𝐺′ ⊆ 𝐺, where 𝐺′ maintains the connectivity and/or distances in 𝐺, by making a sublinear number of probes to the input 𝐺 for each query to 𝐺′ . It is known that worst-case …
-
A hierarchical framework for constructing computationally efficient algorithms for distributed inference problems
… for designing computationally efficient algorithms for large-scale inference systems on system architectures with distributed autonomous agents. The principle of information-based computation is the underlying idea driving elements of this methodology. The methodology consists of a …
-
Enhancing Learning Algorithms via Sublinear-Time Methods
Our society increasingly relies on algorithms and data analysis to make critical decisions. Yet, almost all work in the theory of supervised learning has long relied on the following two assumptions: 1. Distributional assumptions: data satisfies conditions such as Gaussianity or uniformity. 2. No …
-
Symmetries in algebraic Property Testing
… efficiency is a very desirable feature of such algorithms. Local algorithms are especially attractive, since they can imply global properties by only inspecting a small window into the data. In Property Testing, a local algorithm should perform the task of distinguishing objects satisfying a …
-
Energy aware techniques for certain problems in Wireless Sensor Networks
… by extensive simulations of most of the algorithms. These empirical results lead us to believe that the algorithms may be applied in real-world situations where we can achieve a guarantee in the quality of solutions with a certain degree of balanced energy consumption among the sensors.
-
Distributed optimization in multi-agent systems: applications to distributed regression
… Thus, the problem has to be solved using algorithms that are distributed, i.e., different parts of the algorithm are executed at different agents, and local, i.e., each agent uses only information locally available to it and other information it can obtain from its immediate neighbors. In …
-
Computational Hardness in Random Optimization Problems from the Overlap Gap Property
We study the limits of efficient algorithms in random optimization problems. In these problems, we are given a random objective function and our goal is to find an input achieving a large output. These problems often exhibit information-computation gaps, where the maximum objective that exists is …
-
Opportunistic Resource Management to Improve Network Service Performance in User-created Networks
… for mobile end-users can be enabled through localized and location-based solutions using only end-user contributed resources. This is demonstrated through the design and implementation of four services including i) node-based local congestion control that improves message delivery rate for …
-
Control of large distributed systems using games with pure strategy nash equilibria
… main topics. First, we investigate a class of local algorithms for distributed constraint optimisation problems (DCOPs). We introduce a unifying analytical framework for studying such algorithms, and develop a parameterisation of the algorithm design space, which represents a mapping from the …