Sciweavers

2309 search results - page 178 / 462
» Efficient Topological Exploration
Sort
View
CGF
2004
127views more  CGF 2004»
13 years 8 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
CCR
1999
93views more  CCR 1999»
13 years 8 months ago
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic
In ATM UBR networks supporting TCP traffic, optimal efficiency can only be envisaged if switches adopt a discard mechanism that operates at the packet level rather than the cell l...
Vincent Rosolen, Olivier Bonaventure, Guy Leduc
APVIS
2008
13 years 9 months ago
Interactive Storyboard for Overall Time-Varying Data Visualization
Large amounts of time-varying datasets create great challenges for users to understand and explore them. This paper proposes an efficient visualization method for observing overal...
Aidong Lu, Han-Wei Shen
PE
2000
Springer
118views Optimization» more  PE 2000»
13 years 8 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
DATE
2003
IEEE
123views Hardware» more  DATE 2003»
14 years 1 months ago
Parallel Processing Architectures for Reconfigurable Systems
Novel reconfigurable computing architectures exploit the inherent parallelism available in many signalprocessing problems. These architectures often consist of networks of compute...
Kees A. Vissers