256 search results - page 36 / 52 » Approximation Algorithms for Hamming Clustering Problems |
CORR
2010
Springer
14 years 8 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...
PR
2008
14 years 9 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...
80
Voted
ICDM
2009
IEEE
15 years 4 months 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...
65
Voted
IPPS
2000
IEEE
15 years 2 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, ...
CLUSTER
2001
IEEE
15 years 1 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...