2600 search results - page 79 / 520 » Clustering with or without the Approximation |
160
click to vote
PDPTA
2003
15 years 7 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...
152
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
174
click to vote
HICSS
2008
IEEE
16 years 24 days 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...
147
click to vote
IPCCC
2006
IEEE
16 years 11 days 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 ...
173
click to vote
SI3D
1997
ACM
15 years 10 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...