4926 search results - page 75 / 986 » Two Graph Algorithms On an Associative Computing Model |
EPIA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
SDM
2007
SIAM
13 years 11 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
ISVC
2009
Springer
14 years 2 months ago
2009
Springer
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...
ICPP
1992
IEEE
14 years 2 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
3DPVT
2006
IEEE
14 years 4 months ago
2006
IEEE
We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, w...