245 search results - page 41 / 49 » Group connectivity of graphs with diameter at most 2 |
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
CLEIEJ
2010
13 years 5 months ago
2010
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we present a dynamic model for simulating face aging process. We adopt a high resolution grammatical face model[1] and augment it with age and hair features. This mo...
SSDBM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...