In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-infinite cyclic groups where the input is elements in normal form. We do this by adapting the work of Bogopolski, Martino, Maslakova, and Ventura in [1] and Bogopolski, Martino, and Ventura in [2], to free abelian-by-infinite cyclic groups, and in certain cases a...

We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to Kannan since we furthermore show that our result does not relativize. This is the first separation result in complexity theory that does not relativize. As a corollary to our separation result we also obtain that PEXP, ...

We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness ...

DELIVERY OF LAYERED VIDEO DATA. S. Sandeep Pradhan and Kannan Ramchandran Beckman Institute and Department of ECE University of Illinois, Urbana, IL 61801 E-mail:[email protected] and [email protected] ABSTRACT We tackle the problem of e cient image transmission over Multi-Carrier Modulation (MCM) systems, proposing the use of a layered or multiresolution (MR) framework. In this work, we t...

Given a set of data, one central goal is to group them into clusters based on some notion of similarity between the individual objects. One of the most popular and widely-used approaches is K-means despite the computational hardness to find its global minimum. We study and compare the properties of different convex relaxations by relating them to corresponding proximity conditions, an idea orig...

We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness ...

In this paper, as a geometric approach to the fixed-point theory, we prove new fixed-figure results using notion of k-ellipse on metric space. For purpose, are inspired by Caristi type mapping, Kannan contraction, Chatterjea contraction and Ćirić contraction. After that, give some existence uniqueness theorems fixed k-ellipse. We also support our obtained with illustrative examples. Finally, pr...

in this paper, we introduce and study the notion of precompacttopological generalized groups and some new results are given.