337 search results - page 42 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
IEEEPACT
1997
IEEE
14 years 4 days ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs), especially the trabecular bones (TBs). In this paper...
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...