Sciweavers

264 search results - page 28 / 53
» Improved Visual Clustering of Large Multi-dimensional Data S...
Sort
View
JSW
2007
96views more  JSW 2007»
13 years 7 months ago
IP-based Clustering for Peer-to-Peer Overlays
— The efficiency of overlay networks built on top of the IP network is often threatened by the mismatch between the topologies of the overlay and the underlying IP network, resu...
Piotr Karwaczynski, Jaka Mocnik
CLUSTER
2005
IEEE
14 years 1 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
SC
2000
ACM
14 years 2 days ago
From Trace Generation to Visualization: A Performance Framework for Distributed Parallel Systems
In this paper we describe a trace analysis framework, from trace generation to visualization. It includes a unified tracing facility on IBM® SP™ systems, a self-defining interv...
Ching-Farn Eric Wu, Anthony Bolmarcich, Marc Snir,...
INFOVIS
2003
IEEE
14 years 1 months ago
Interactive Hierarchical Dimension Ordering, Spacing and Filtering for Exploration of High Dimensional Datasets
Large numbers of dimensions not only cause clutter in multidimensional visualizations, but also make it difficult for users to navigate the data space. Effective dimension manage...
Jing Yang, Wei Peng, Matthew O. Ward, Elke A. Rund...
TVCG
2010
165views more  TVCG 2010»
13 years 2 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin