Browsing University of Waterloo by Subject "NP-hardness"
Now showing items 1-2 of 2
-
Computational Complexity Of Bi-clustering
(University of Waterloo, 2008-08-26)In this work we formalize a new natural objective (or cost) function for bi-clustering - Monochromatic bi-clustering. Our objective function is suitable for detecting meaningful homogenous clusters based on categorical ... -
Strategic and Stochastic Approaches to Modeling the Structure of Multi-Layer and Interdependent Networks
(University of Waterloo, 2016-08-12)Examples of complex networks abound in both the natural world (e.g., ecological, social and economic systems), and in engineered applications (e.g., the Internet, the power grid, etc.). The topological structure of such ...