The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Recently, due to problems arising from lattice mismatch in thin film growth in semiconductor manufacturing industry, researchers have shown great interest in modeling the physioch...
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...