We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is no...
Multi-hop wireless mesh networks are increasingly being deployed for last-mile Internet access. Typically, network algorithms such as routing, channel assignment and topology cont...
Saumitra M. Das, Himabindu Pucha, Konstantina Papa...
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...