We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical model...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...