no code implementations • 16 Oct 2022 • Nicholas D. Sidiropoulos, Paris Karakasis, Aritra Konar
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.
no code implementations • 1 Oct 2020 • Faisal M. Almutairi, Aritra Konar, Ahmed S. Zamzam, Nicholas D. Sidiropoulos
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.
no code implementations • 18 Aug 2020 • Aritra Konar, Nicholas D. Sidiropoulos
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.