Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...