Sciweavers

301 search results - page 15 / 61
» Narrowing Directed by a Graph of Terms
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 10 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
CGF
2008
165views more  CGF 2008»
13 years 7 months ago
Visual Inspection of Multivariate Graphs
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...
A. Johannes Pretorius, Jarke J. van Wijk
ATAL
2005
Springer
14 years 1 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 24 days ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
MOBICOM
2012
ACM
11 years 10 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...