1105 search results - page 111 / 221 » Approximate Spectral Clustering. |
98
Voted
PDPTA
2003
15 years 2 months ago
2003
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
109
Voted
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
88
Voted
IPCCC
2006
IEEE
15 years 6 months ago
2006
IEEE
Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technologies to optimize remote memory access. In contrast, we revisit the idea of ...
115
click to vote
SI3D
1997
ACM
15 years 5 months ago
1997
ACM
This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. It is based on a previously developed model simplific...
94
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...