329 search results - page 36 / 66 » New lower bounds for some spherical designs |
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
ALGORITHMICA
1998
14 years 11 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
PPOPP
2006
ACM
15 years 5 months ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
STOC
2001
ACM
16 years 3 days ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...