256 search results - page 36 / 52 » Approximation Algorithms for Hamming Clustering Problems |
166
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
196
click to vote
PR
2008
15 years 5 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
157
click to vote
ICDM
2009
IEEE
16 years 15 days ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
137
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
160
click to vote
CLUSTER
2001
IEEE
15 years 9 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...