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 420 for “"lower bounds"”.
-
Lower bounds in distributed computing
… a shared resource. We prove a tight Q(n log n) lower bound on the time for n processes to each access the resource once. .
-
Upper and Lower Bounds for Sampling
… understanding of sampling by giving upper bounds and more importantly lower bounds for various sampling algorithms and problem classes. On the upper bound side, we propose new sampling algorithms, motivated by the perspective of sampling as optimization [JKO98], and give convergence …
-
A Metastudy of Algorithm Lower Bounds
… found that improvements to algorithm upper bounds have been steadily decreasing since the 1970s. In this work we aim to discover whether this could be because researchers have already found the optimal versions of many algorithms. In order to get a better sense of the picture, we compiled …
-
Lower Bounds and Algorithms for Searching Networks
… yet been revealed. In this thesis, we give new lower bounds on the fast search number. Using the new lower bounds, we prove an explicit formula for the fast search number of the cartesian product of an Eulerian graph and a path. We also give formulas for the fast search number of variants of the …
-
Conditional lower bounds for graph sensitivity problems
In this thesis, we show conditional lower bounds for graph distance problems in the sensitivity setting, a restriction on the dynamic setting. We consider graph diameter, radius, and eccentricities over a few distance metrics, and sensitivities both constant and logarithmic in the size of the …
-
Algorithms and lower bounds for sparse recovery
We consider the following k-sparse recovery problem: design a distribution of m x n matrix A, such that for any signal x, given Ax with high probability we can efficiently recover x satisfying IIx - x l, </-Cmink-sparse x' IIx - x'II. It is known that there exist such distributions with m = O(k …
-
Quantum randomness expansion : upper and lower bounds
… expansion, as well as the first upper bounds on the maximum expansion achievable by a broad class of randomness amplifiers. In particular, we show that non-adaptive randomness amplifiers that are robust to noise cannot achieve more than doubly exponential expansion. We show that a wide …
-
Estimating lower bounds for time series prediction error
… This research presents a way to estimate lower bounds for a time series prediction error by utilizing the conditional entropy rate, which allows us to take the inherent difficulty of a problem into account. The main focus of this research is on a discrete time series composed of discrete …
-
Algorithms and lower bounds in finite automata size complexity
In this thesis we investigate the relative succinctness of several types of finite automata, focusing mainly on the following four basic models: one-way deterministic (1)FAs), one-way nondeterministic (1NFAs), two-way deterministic (2DFAS), and two-way nondeterministic (2NFAS). First, we establish …
-
Connections between circuit analysis problems and circuit lower bounds
… Minimum Size Circuit Problem (MCSP). A circuit lower bound presents an interesting function f and shows that no "easy" family of logical circuits can compute f correctly on all inputs, for some definition of "easy". Lower bounds are infamously hard to prove, but are of significant interest for …
-
New algorithms and lower bounds for sequential-access data compression
… and sufficient for achieving entropy-only bounds.
-
Lower bounds on pose estimation with high range-resolution radar
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
-
Satisfiability Algorithms and Connections between Algorithms and Circuit Lower Bounds
… and connections between algorithms and circuit lower bounds. We give new results in the following three areas: Oracles and Algorithmic Methods for Proving Lower Bounds: We give an equivalence between relativizing circuit lower bounds (circuit lower bounds which hold with respect to all oracles) …
-
LP/SDP hierarchy lower bounds for decoding random LDPC codes
Random (dv, dc)-regular LDPC codes (where each variable is involved in d, parity checks and each parity check involves d, variables) are well-known to achieve the Shannon capacity of the binary symmetric channel (for sufficiently large dv, and dc,) under exponential time decoding. However, …
-
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
… randomness in efficient computation, proving lower bounds for efficiently computable problems, and in computing cryptographic primitives. We observe [Coo71] that logarithmic space-bounded Turing Machines, equipped with an unbounded stack, henceforth called Stack Machines, together with an …
-
Upper and lower bounds for the fixed spectrum frequency assignment problem
… treated, is described.<br/><br/>Some novel lower bounding techniques which, given a problem, work by combining lower bounds calculated for some of its clique-like subproblems are presented. The key idea is that it is quite easy to calculate tight lower bounds for problems represented by …
-
On lower bounds for the betti numbers of finite length modules
In this manuscript we consider multigraded modules. Chapter 1 gives the necessary definitions and examples that develop the theory of multigraded modules. A multigraded module has a multigraded minimal resolution. We give the necessary conditions for a matrix to correspond to a multigraded map and …
-
Computations and lower bounds for scl and the relative Gromov seminorm
… scl. Another aspect of this thesis is to obtain lower bounds for stable commutator length in the presence of negative curvature. We do this by developing a new geometric method, where surfaces estimating scl are equipped with a combinatorial geometric structure called an angle structure, and for …
Page 1 of 21