6575 search results - page 116 / 1315 » Specializing visualization algorithms |
122
click to vote
EPIA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
135
click to vote
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this article we present EANT2, a method that creates neural networks (NNs) by evolutionary reinforcement learning. The structure of NNs is developed using mutation ope...
157
click to vote
VISSYM
2003
15 years 4 months ago
2003
We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthog...
133
Voted
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract Parallel algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are discussed. Algorithms based on quasi-Monte Carlo techniques ...
123
Voted
GRAPHITE
2003
ACM
15 years 8 months ago
2003
ACM
The complexity of most virtual environments prevents them being rendered in real time even on modern graphics hardware. Knowledge of the visual system of the user viewing the envi...