5393 search results - page 268 / 1079 » Spatial Computing with Labels |
361
click to vote
Presentation
This is the recording of a 2-day tutorial given in May 2002. It is a 8-topic tutorial which covers the following topics: Networking Trends, QoS over Data Networks, Label Switching,...
150
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
159
click to vote
ACCV
1998
Springer
15 years 10 months ago
1998
Springer
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
132
Voted
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models...
159
Voted
ECEASST
2010
15 years 3 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...