3708 search results - page 68 / 742 » Approximating Betweenness Centrality |
131
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
138
click to vote
HYBRID
2007
Springer
15 years 10 months ago
2007
Springer
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
132
click to vote
AAECC
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
132
click to vote
ENGL
2008
15 years 4 months ago
2008
The improvement on the QSAR prediction of the trans-stilbenes affinity for the -amyloid peptide (employed for detecting the Alzheimer disease) achieved by means of using approximat...
153
click to vote
JSCIC
2008
15 years 4 months ago
2008
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...