Improved Alignment-Based Algorithm for Multilingual Text Compression

Multilingual text compression exploits the existence of the same text in several languages to compress the second and subsequent copies by reference to the first. This is done based on bilingual text alignment, a mapping of words and phrases in one text to their semantic equivalents in the translation. A new multilingual text compression scheme is suggested, which improves over an immediate generalization of bilingual algorithms. The idea is to store the necessary markup data within the source language text; the incurred compression loss due to this overhead is smaller than the savings in the compressed target language texts, for a large enough number of the latter. Experimental results are presented for a parallel corpus in six languages extracted from the EUR-Lex website of the European Union. These results show the superiority of the new algorithm as a function of the number of languages.     

Robust integer programming

We provide a complexity classification of four variants of robust integer programming when the underlying Graver basis is given. We discuss applications to robust multicommodity flows and multiway statistical table problems, and describe an effective parametrization of robust integer programming.     

Finding the Homology of Submanifolds with High Confidence from Random Samples

Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high-dimensional spaces. We consider the case where data are drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space. We show how to “learn” the homology of the submanifold with high confidence. We discuss an algorithm to do this and provide learning-theoretic complexity bounds. Our bounds are obtained in terms of a condition number that limits the curvature and nearness to self-intersection of the submanifold. We are also able to treat the situation where the data are “noisy” and lie near rather than on the submanifold in question. The main results of this paper were first presented at a conference in honor of John Franks and Clark Robinson at Northwestern University in April 2003. These results were formally written as Technical Report No. TR-2004-08, Department of Computer Science, University of Chicago.     

On the vanishing of homology in random Čech complexes

We compute the homology of random ?ech complexes over a homogeneous Poisson process on the d‐dimensional torus, and show that there are, coarsely, two phase transitions. The first transition is analogous to the Erd?s ‐Rényi phase transition, where the ?ech complex becomes connected. The second transition is where all the other homology groups are computed correctly (almost simultaneously). Our calculations also suggest a finer measurement of scales, where there is a further refinement to this picture and separation between different homology groups. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 14–51, 2017     

A polynomial oracle-time algorithm for convex integer minimization

In this paper we consider the solution of certain convex integer minimization problems via greedy augmentation procedures. We show that a greedy augmentation procedure that employs only directions from certain Graver bases needs only polynomially many augmentation steps to solve the given problem. We extend these results to convex N-fold integer minimization problems and to convex 2-stage stochastic integer minimization problems. Finally, we present some applications of convex N-fold integer minimization problems for which our approach provides polynomial time solution algorithms.     

A few remarks on sampling of signals with small spectrum

Given a bounded set S of small measure, we discuss the existence of sampling sequences for the Paley-Wiener space PW _S , which have both densities and sampling bounds close to the optimal ones.     

Tiebout and sympathy

In its simplest form the Tiebout hypothesis suggests that redistribution by local government is not sustainable because individuals, when confronted by negative net fiscal benefits, will vote with their feet, changing their residential locations to jurisdictions which offer a more favorable fiscal balance. It is usually thought, moreover, that they will move (e.g. from central city to suburbs) in descending order of income.Recognition of extended preference modifies this simple characterization of the tiebout process, in which the process of relocation is like ‘peeling an onion’. Any relocation sequence is possible, with either sympathy or antipathy. Even for sympathetic individuals with identical tastes, restrictive and unrealistic assumptions are required to predict, with certainty, that individuals with higher incomes would be the first to move. In particular the marginal tax rate must exceed unity. With antipathy, individuals with lower incomes may move before those with higher incomes, even if net fiscal benefits decrease with income, if they become more willing to begrudge transfers to others as their incomes increase.