Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Frequent failures are becoming a serious concern to the community of high-end computing, especially when the applications and the underlying systems rapidly grow in size and compl...
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical ap...