54 search results - page 4 / 11 » Estimating the number of vertices of a polyhedron |
IJBC
2007
13 years 7 months ago
2007
Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it ...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
The position of a world point’s solar shadow depends on its geographical location, the geometrical relationship between the orientation of the sunshine and the ground plane wher...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...