2004 search results - page 119 / 401 » Sampling from large graphs |
146
click to vote
TAMC
2010
Springer
15 years 1 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
122
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
115
click to vote
APVIS
2007
15 years 4 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
122
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
123
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...