Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
— Multidimensional or group independent component analysis describes the task of transforming a multivariate observed sensor signal such that groups of the transformed signal com...
Several kernel algorithms have recently been proposed for nonlinear discriminant analysis. However, these methods mainly address the singularity problem in the high dimensional fe...
Distributed applications provide numerous advantages related to software performance, reliability, interoperability, and extensibility. This paper focuses on distributed Java prog...