147 search results - page 21 / 30 » Parallel Query Processing and Edge Ranking of Graphs |
119
click to vote
CCGRID
2010
IEEE
14 years 11 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
WWW
2008
ACM
16 years 2 months ago
2008
ACM
In this paper, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose an algorithm to analyz...
132
click to vote
CIKM
2010
Springer
15 years 15 hour ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...
ISCI
2007
15 years 1 months ago
2007
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...