3708 search results - page 190 / 742 » Approximating Betweenness Centrality |
167
click to vote
STOC
2004
ACM
16 years 6 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...
174
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...
168
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
168
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
170
click to vote
FPL
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Function evaluation is at the core of many compute-intensive applications which perform well on reconfigurable platforms. Yet, in order to implement function evaluation ...