Sciweavers

5606 search results - page 428 / 1122
» Randomization Techniques for Graphs.
Sort
View
IPPS
1999
IEEE
15 years 11 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
PROCEDIA
2010
344views more  PROCEDIA 2010»
15 years 5 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
16 years 1 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...
194
Voted
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 6 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
GD
2005
Springer
16 years 8 days ago
A Hybrid Model for Drawing Dynamic and Evolving Graphs
Dynamic processes frequently occur in many applications. Visualizations of dynamically evolving data, for example as part of the data analysis, are typically restricted to a cumula...
Marco Gaertler, Dorothea Wagner