1439 search results - page 62 / 288 » Fast approximation of centrality |
115
click to vote
VISUALIZATION
1997
IEEE
15 years 4 months ago
1997
IEEE
Oriented Line Integral Convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying ...
107
Voted
CAV
2006
Springer
15 years 4 months ago
2006
Springer
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
IDA
1998
Springer
15 years 10 days ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
102
Voted
TNN
1998
15 years 9 days ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...