We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Abstract. Approximate reasoning is used in a variety of reasoning tasks in Logicbased Artificial Intelligence. In this abstract we compare a number of such reasoning schemes and s...
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...