Sciweavers

1794 search results - page 77 / 359
» Visualizing Memory Graphs
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 8 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
IWANN
2009
Springer
15 years 10 months ago
Integrating Graph-Based Vision Perception to Spoken Conversation in Human-Robot Interaction
In this paper we present the integration of graph-based visual perception to spoken conversation in human-robot interaction. The proposed architecture has a dialogue manager as the...
Wendy Aguilar, Luis A. Pineda
160
Voted
DAGSTUHL
2001
15 years 5 months ago
An Overview of the GXL Graph Exchange Language
GXL (Graph eXchange Language) is designed to be a standard exchange format for graph-based tools. GXL is defined as an XML sublanguage, which offers support for exchanging instanc...
Andreas Winter, Bernt Kullbach, Volker Riediger
VL
2010
IEEE
261views Visual Languages» more  VL 2010»
15 years 2 months ago
Euler Graph Transformations for Euler Diagram Layout
— Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by...
Peter Rodgers, Gem Stapleton, John Howse, Leishi Z...
PVLDB
2010
151views more  PVLDB 2010»
15 years 2 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh