3708 search results - page 62 / 742 » Approximating Betweenness Centrality |
101
Voted
ENTCS
2008
15 years 18 days ago
2008
We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...
94
Voted
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We propose an analytic approach to approximate the survival probabilities of schemata under multi-point crossover and obtain its closed form. It gives a convenient way to...
127
Voted
CIKM
2000
Springer
15 years 4 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
101
Voted
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...