1439 search results - page 23 / 288 » Fast approximation of centrality |
SOFSEM
2005
Springer
14 years 4 months ago
2005
Springer
ESA
2004
Springer
14 years 4 months ago
2004
Springer
ICCSA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
JCDCG
2004
Springer
14 years 4 months ago
2004
Springer
STOC
1999
ACM
14 years 3 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...