4913 search results - page 135 / 983 » Results and Perspectives of the G |
181
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
180
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
186
click to vote
CRYPTO
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
203
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
222
click to vote
TIFS
2010
15 years 4 months ago
2010
—We study the optimum location of an eavesdropper from a secrecy capacity perspective in multiterminal networks with power control. We determine the logical location of an eavesd...