1439 search results - page 115 / 288 » Fast approximation of centrality |
108
click to vote
CG
2005
Springer
15 years 21 days ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
100
click to vote
JMIV
2002
15 years 14 days ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
151
Voted
ARITH
2011
IEEE
14 years 24 days ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
122
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
101
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...