Sciweavers

353 search results - page 7 / 71
» From graph states to two-graph states
Sort
View
ESWS
2004
Springer
14 years 1 months ago
S-Match: an Algorithm and an Implementation of Semantic Matching
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
COMBINATORICA
2011
12 years 7 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
CONCUR
2006
Springer
13 years 11 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
COLING
2000
13 years 9 months ago
Compiling Language Models from a Linguistically Motivated Unification Grammar
Systems now exist which are able to con:pile unification gralmnars into language models that can be included in a speech recognizer, but it is so far unclear whether non-trivial l...
Manny Rayner, Beth Ann Hockey, Frankie James, Eliz...
ISLPED
1997
ACM
83views Hardware» more  ISLPED 1997»
14 years 1 days ago
A symbolic algorithm for low-power sequential synthesis
We present an algorithm that restructures the state transition graph STG of a sequential circuit so as to reduce power dissipation. The STG is modi ed without changing the behav...
Balakrishna Kumthekar, In-Ho Moon, Fabio Somenzi