401 search results - page 33 / 81 » Sparse Quasi-Random Graphs |
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
CGF
2010
13 years 8 months ago
2010
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We start with a locally defined principal curve definition for a given probability density function (pdf) and define a pairwise manifold score based on local derivatives of the...
APVIS
2006
13 years 9 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...