1434 search results - page 184 / 287 » Graph Searching with Advice |
145
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
150
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
127
Voted
ICS
2010
Tsinghua U.
16 years 28 days ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
138
Voted
ICCD
2003
IEEE
16 years 14 days ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
137
Voted
IEEECIT
2009
IEEE
15 years 10 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...