Sciweavers

346 search results - page 29 / 70
» On the sizes of Delaunay meshes
Sort
View
EWC
2008
117views more  EWC 2008»
13 years 7 months ago
Performance of parallel computations with dynamic processor allocation
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
Saeed Iqbal, Graham F. Carey
JPDC
2007
173views more  JPDC 2007»
13 years 7 months ago
Probabilistic analysis on mesh network fault tolerance
Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of wor...
Jianer Chen, Gaocai Wang, Chuang Lin, Tao Wang, Gu...
GD
2006
Springer
13 years 11 months ago
Controllable and Progressive Edge Clustering for Large Networks
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...
Huamin Qu, Hong Zhou, Yingcai Wu
ICPR
2010
IEEE
13 years 7 months ago
Improved Mean Shift Algorithm with Heterogeneous Node Weights
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Ji Won Yoon, Simon P. Wilson
CGF
2006
146views more  CGF 2006»
13 years 7 months ago
Competing Fronts for Coarse-to-Fine Surface Reconstruction
We present a deformable model to reconstruct a surface from a point cloud. The model is based on an explicit mesh representation composed of multiple competing evolving fronts. Th...
Andrei Sharf, Thomas Lewiner, Ariel Shamir, Leif K...