197 search results - page 7 / 40 » Improved Approximation Algorithms for Bipartite Correlation ... |
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
RTCSA
2003
IEEE
14 years 24 days ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
MMM
2011
Springer
12 years 11 months ago
2011
Springer
Probabilistic Latent Semantic Analysis (PLSA) has become a popular topic model for image clustering. However, the traditional PLSA method considers each image (document) independen...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...