2004 search results - page 172 / 401 » Sampling from large graphs |
108
Voted
MICCAI
2002
Springer
16 years 4 months ago
2002
Springer
A large number of test images and their "ground truth" segmentations are needed for performance characterization of the many image segmentation methods. In this work we ...
102
click to vote
ACL
2001
15 years 4 months ago
2001
This paper presents methods for a qualitative, unbiased comparison of lexical association measures and the results we have obtained for adjective-noun pairs and preposition-noun-v...
123
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
143
click to vote
ISPASS
2009
IEEE
15 years 10 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
147
Voted
ICITA
2005
IEEE
15 years 9 months ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...