Sciweavers

1648 search results - page 31 / 330
» On the generation of bicliques of a graph
Sort
View
PARLE
1987
15 years 1 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
MFCS
2007
Springer
15 years 3 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 4 days ago
Ego-centric Graph Pattern Census
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
Walaa Eldin Moustafa, Amol Deshpande, Lise Getoor
90
Voted
CVPR
2012
IEEE
13 years 3 days ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
ICALP
2000
Springer
15 years 1 months ago
A Generic Model for Diagram Syntax and Semantics
In this paper, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN, and outline a visual, rule-based, and objectoriented programming language b...
Berthold Hoffmann, Mark Minas