925 search results - page 56 / 185 » Connectivity on Complete Lattices |
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
NIPS
2004
15 years 1 months ago
2004
This paper presents a neuromorphic model of two olfactory signalprocessing primitives: chemotopic convergence of olfactory receptor neurons, and center on-off surround lateral inh...
JSYML
2007
14 years 11 months ago
2007
Let M = M, +, <, 0, {λ}λ∈D be an ordered vector space over an ordered division ring D, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is defin...
113
click to vote
EMNLP
2009
14 years 9 months ago
2009
Current system combination methods usually use confusion networks to find consensus translations among different systems. Requiring one-to-one mappings between the words in candid...
GC
2006
Springer
14 years 12 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...