596 search results - page 9 / 120 » Complexity Analysis by Graph Rewriting |
178
click to vote
DOCENG
2003
ACM
15 years 11 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
158
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
155
click to vote
ISMAR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we explore the effect of using Augmented Reality for three-dimensional graph link analysis. Two experiments were conducted. The first was designed to compare a tangi...
169
click to vote
ICPR
2008
IEEE
16 years 8 days ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
174
click to vote
EKNOW
2009
15 years 3 months ago
2009
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...