Search Results for author:
Found 3 papers, 0 papers with code
Minimizing low-rank models of high-order tensors: Hardness, span, tight relaxation, and applications
We show that this fundamental tensor problem is NP-hard for any tensor rank higher than one, and polynomial-time solvable in the rank-one case.
PHASED: Phase-Aware Submodularity-Based Energy Disaggregation
Energy disaggregation is the task of discerning the energy consumption of individual appliances from aggregated measurements, which holds promise for understanding and reducing energy usage.
Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods
In this work, we formally establish that two recurring characteristics of real-world graphs, namely heavy-tailed degree distributions and large clustering coefficients, imply the existence of substantially large vertex neighborhoods with high edge-density.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
