In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
A two layer coding algorithm for high dynamic range images is discussed. In the first layer, a low dynamic range image is encoded by a conventional codec, and then the residual in...
We present a novel 3-D scalable compression method for medical images with optimized volume of interest (VOI) coding. The method is presented within the framework of interactive te...
Victor Sanchez, Rafeef Abugharbieh, Panos Nasiopou...
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Highly interactive real-time music applications like network music performance (NMP) currently lack appropriate audio codecs that meet both demands for low delay and high audio qu...