2137 search results - page 320 / 428 » Experiments on Graph Clustering Algorithms |
FSTTCS
1993
Springer
14 years 1 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
CSCWD
2008
Springer
13 years 10 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
IJHPCA
2006
13 years 9 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
ICCV
2001
IEEE
14 years 11 months ago
2001
IEEE
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...