Sciweavers

1794 search results - page 251 / 359
» Visualizing Memory Graphs
Sort
View
ECEASST
2008
88views more  ECEASST 2008»
15 years 2 months ago
Reconfiguration of Reo Connectors Triggered by Dataflow
Abstract: Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed f...
Christian Koehler, David Costa, José Proen&...
JPDC
2007
177views more  JPDC 2007»
15 years 2 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
126
Voted
CIKM
2010
Springer
15 years 13 days ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
TKDE
2011
362views more  TKDE 2011»
14 years 9 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
CIKM
2011
Springer
14 years 2 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
Mo Zhou, Yifan Pan, Yuqing Wu