4074 search results - page 267 / 815 » Abstract Graph Transformation |
151
click to vote
SEMWEB
2007
Springer
16 years 20 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
160
click to vote
STACS
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
186
click to vote
CIVR
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper, we present a framework for segmenting the news programs into different story topics. The proposed method utilizes both visual and text information of the v...
167
click to vote
ACSD
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
159
click to vote
WG
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...