3204 search results - page 273 / 641 » The Alcuin Number of a Graph |
198
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
187
click to vote
ISPASS
2009
IEEE
16 years 1 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
167
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
206
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
164
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...