56 search results - page 6 / 12 » Holes in Graphs |
MOBIHOC
2009
ACM
16 years 10 days ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
SIGMETRICS
2006
ACM
15 years 5 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
103
click to vote
DGCI
2009
Springer
15 years 3 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
155
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...