We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...