7015 search results - page 403 / 1403 » Approximation algorithms for co-clustering |
210
click to vote
COMPGEOM
2004
ACM
16 years 7 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
181
click to vote
LATIN
2004
Springer
16 years 5 days ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
178
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
165
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
176
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...