3708 search results - page 106 / 742 » Approximating Betweenness Centrality |
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
107
Voted
FCT
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
87
Voted
RTSS
2002
IEEE
15 years 5 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
121
click to vote
COMPGEOM
1998
ACM
15 years 4 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
115
Voted
CPM
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...