966 search results - page 109 / 194 » Small Alliances in Graphs |
CVPR
2005
IEEE
15 years 16 hour ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
EUROSYS
2007
ACM
14 years 7 months ago
2007
ACM
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication ...
ESSOS
2010
Springer
14 years 6 months ago
2010
Springer
Information flow control systems provide the guarantees that are required in today’s security-relevant systems. While the literature has produced a wealth of techniques to ensur...
SP
2009
IEEE
14 years 4 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...
WDAG
2009
Springer
14 years 4 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...