Sciweavers

596 search results - page 9 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
DOCENG
2003
ACM
14 years 1 months ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
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 ...
Jean-Yves Vion-Dury
ICALP
2001
Springer
14 years 11 days ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
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...
Amit Chakrabarti, Subhash Khot
ISMAR
2003
IEEE
14 years 1 months ago
Using Augmented Reality for Visualizing Complex Graphs in Three Dimensions
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...
Daniel Belcher, Mark Billinghurst, Sean Hayes, Ran...
ICPR
2008
IEEE
14 years 2 months ago
Birkhoff polytopes, heat kernels and graph complexity
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 ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
EKNOW
2009
13 years 5 months ago
Visual Middle-Out Modeling of Problem Spaces
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-...
Andrea Valente