335 search results - page 20 / 67 » High quality graph partitioning |
ICDM
2006
IEEE
14 years 5 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
ISCAS
2007
IEEE
14 years 5 months ago
2007
IEEE
— This paper presents a method of low-power variable-block-size motion estimation using pixel truncation. Previous work focused on implementing pixel truncation using fixed-bloc...
GD
2009
Springer
14 years 3 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
SPAA
1997
ACM
14 years 3 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
CVPR
2007
IEEE
15 years 28 days ago
2007
IEEE
This paper presents a framework to automatically detect and recover the occluded facial region. We first derive a Bayesian formulation unifying the occlusion detection and recover...