3267 search results - page 284 / 654 » Generalized quasirandom graphs |
177
click to vote
ACL
2004
15 years 8 months ago
2004
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
159
click to vote
ESANN
2003
15 years 8 months ago
2003
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
157
click to vote
COMBINATORICA
2008
15 years 7 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
183
click to vote
DAM
2008
15 years 7 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
185
click to vote
EJC
2010
15 years 7 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...