: The ability to estimate the communication latency between arbitrary hosts on the Internet would enable the distributed computing applications to find the closest server or to fin...
R. Vijayprasanth, R. Kavithaa, Rajkumar Kettimuthu
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
Classical data mining algorithms implicitly assume complete access to all data, either in centralized or federated form. However, privacy and security concerns often prevent sharin...
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...
We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The appro...