Sciweavers

5606 search results - page 418 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
16 years 1 months ago
Temporal Analysis of Semantic Graphs Using ASALSAN
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
Brett W. Bader, Richard A. Harshman, Tamara G. Kol...
IPPS
2007
IEEE
16 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
APVIS
2004
15 years 8 months ago
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens.
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
Wanchun Li, Masahiro Takatsuka
TVCG
2008
138views more  TVCG 2008»
15 years 6 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
SAC
2008
ACM
15 years 6 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...