690 search results - page 23 / 138 » Dense Admissible Sets |
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
Reducing the code size of embedded applications is one of the important constraint in embedded system design. Code compression can provide substantial savings in terms of size. In...
JSYML
2010
13 years 2 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
CRYPTO
2012
Springer
11 years 9 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
COMSWARE
2008
IEEE
13 years 9 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...