68 search results - page 11 / 14 » Computing Graph Roots Without Short Cycles |
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
WAW
2007
Springer
15 years 5 months ago
2007
Springer
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
JPDC
1998
14 years 11 months ago
1998
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
SIGCOMM
2010
ACM
14 years 11 months ago
2010
ACM
Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today&...
TCC
2007
Springer
15 years 5 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...