779 search results - page 83 / 156 » Algorithms for the Sample Mean of Graphs |
136
click to vote
ICN
2005
Springer
15 years 10 months ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiď¬...
164
click to vote
FGR
2008
IEEE
15 years 11 months ago
2008
IEEE
Partial occlusions in face images pose a great problem for most face recognition algorithms. Several solutions to this problem have been proposed over the years – ranging from d...
162
click to vote
IVC
2008
15 years 4 months ago
2008
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
160
Voted
TWC
2008
15 years 4 months ago
2008
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
117
click to vote
ICCAD
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...