相关论文: Lowest Terms Revisited
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…
Probabilistic programming is becoming increasingly popular thanks to its ability to specify problems with a certain degree of uncertainty. In this work, we focus on term rewriting, a well-known computational formalism. In particular, we…
In this paper, we investigate the minimization of a functional in which the usual perimeter is competing with a nonlocal singular term comparable (but not necessarily equal to) a fractional perimeter. The motivation for this problem is a…
We reduce the leading term in Lehman's theorem. This improved estimate allows us to refine the main theorem of Bays and Hudson. Entering $2,000,000$ Riemann zeros, we prove that there exists $x$ in the interval $[exp(727.951858),…
The box-constrained integer least squares problem (BILS) arises in MIMO wireless communications applications. Typically a sphere decoding algorithm (a tree search algorithm) is used to solve the problem. In order to make the search…
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
The average size of the "smallest gap" of a partition was studied by Grabner and Knopfmacher in 2006. Recently, Andrews and Newman, motivated by the work of Fraenkel and Peled, studied the concept of the "smallest gap" under the name…
In this paper, we present efficient pseudodeterministic algorithms for both the global minimum cut and minimum s-t cut problems. The running time of our algorithm for the global minimum cut problem is asymptotically better than the fastest…
Let $G$ be an $n$-vertex graph, and $s,t$ vertices of $G$. We present an efficient algorithm which enumerates the set of minimal $st$-separators of $G$ in ascending order of cardinality, with a delay of $O(n^{3.5})$ per separator. In…
The reduced-rank method exploits the distortion-variance tradeoff to yield superior solutions for classic problems in statistical signal processing such as parameter estimation and filtering. The central idea is to reduce the variance of…
This paper studies the Hardy-type inequalities on the discrete intervals. The first result is the variational formulas of the optimal constants. Using these formulas, one may obtain an approximating procedure and the known basic estimates…
Given a parametrized family of finite frames, we consider the optimization problem of finding the member of this family whose coefficient space most closely contains a given data vector. This nonlinear least squares problem arises naturally…
The composition problem for shortest paths asks the following: given shortest paths on weighted graphs M and N which share a common boundary, find the shortest paths on their union. This problem is a crucial step in any algorithm which uses…
Minimizers sampling is one of the most widely-used mechanisms for sampling strings [Roberts et al., Bioinformatics 2004]. Let $S=S[1]\ldots S[n]$ be a string over a totally ordered alphabet $\Sigma$. Further let $w\geq 2$ and $k\geq 1$ be…
We formalize the problem of selecting the optimal set of options for planning as that of computing the smallest set of options so that planning converges in less than a given maximum of value-iteration passes. We first show that the problem…
Finding the shortest path in a graph has applications to a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest path…
This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem…
We solve a problem due to Recam\'an about the lower bound behavior of the maximum possible length among all arithmetic progressions in the least reduced residue system modulo $n$, as $n \to \infty$.
In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…
The problem of assessing the performance of algorithms used for the minimization of an $\ell_1$-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation…