291 search results - page 54 / 59 » Clustering and the Biclique Partition Problem |
CCGRID
2008
IEEE
14 years 2 months ago
2008
IEEE
To be competitive, Enterprises are collecting and analyzing increasingly large amount of data in order to derive business insights. However, there are at least two challenges to m...
ISPDC
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors....
CIKM
2000
Springer
14 years 3 days ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
HPCN
1998
Springer
13 years 12 months ago
1998
Springer
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
SIAMDM
2008
13 years 7 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...