3708 search results - page 122 / 742 » Approximating Betweenness Centrality |
87
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
117
Voted
NIPS
2008
15 years 2 months ago
2008
We present a sparse approximation approach for dependent output Gaussian processes (GP). Employing a latent function framework, we apply the convolution process formalism to estab...
95
Voted
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
99
Voted
EUROCAST
2005
Springer
15 years 6 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
TC
2008
15 years 18 days ago
2008
This paper examines the hardware implementation trade-offs when evaluating functions via piecewise polynomial approximations and interpolations for precisions of up to 24 bits. In ...