Results 1  10
of
233
Lexicographic products in metarouting
, 2007
"... Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the most important attribute of each route is considered first, and if this does not give enough information to decide which rou ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
route is better, the next attribute is considered; and so on. We investigate protocols that find globally optimal paths and protocols that find only locally optimal paths. In each case we characterize exactly when lexicographic products can be used to define wellbehaved routing protocols. We apply our
Absorbing Lexicographic Products in Metarouting
"... Abstract—Modern treatments of routing protocols use algebraic techniques to derive the protocol’s properties, permitting a semantic richness more flexible than simple numerical “shortest paths”. Many such routing protocols make preference decisions based on multiple criteria. This fits well with an ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
on each of the algebraic formulations representing a strata. In this paper we examine a stratified routing algebra based on a recently suggested absorbing product and provide the necessary and sufficient conditions required by each of the operands to guarantee that such a routing language ensures globally
Retrieving Collocations from Text: Xtract
 Computational Linguistics
, 1993
"... Natural languages are full of collocations, recurrent combinations of words that cooccur more often than expected by chance and that correspond to arbitrary word usages. Recent work in lexicography indicates that collocations are pervasive in English; apparently, they are common in all types of wri ..."
Abstract

Cited by 353 (1 self)
 Add to MetaCart
. In this paper, we describe a set of techniques based on statistical methods for retrieving and identifying collocations from large textual corpora. These techniques produce a wide range of collocations and are based on some original filtering methods that allow the production of richer and higher
Lexicographic semigroupoids
 J. Ergodic Theory and Dynamical Systems
, 1996
"... The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper triangular matrix algebras. Consider a Cantor space which is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper triangular matrix algebras. Consider a Cantor space which
LEXICOGRAPHERS ’ DREAMS IN THE
"... The arrival of the modern computer set in motion a series of lexicographers ’ dreams without equal in the history of dictionary making. Achieving the wildest of those electronicdictionary vistas has the potential to result in reference works beyond all recognition. This potential, alas, remains to ..."
Abstract
 Add to MetaCart
The arrival of the modern computer set in motion a series of lexicographers ’ dreams without equal in the history of dictionary making. Achieving the wildest of those electronicdictionary vistas has the potential to result in reference works beyond all recognition. This potential, alas, remains
Rees products and lexicographic shellability
, 2012
"... We use the theory of lexicographic shellability to provide various examples in which the rank of the homology of a Rees product of two partially ordered sets enumerates some set of combinatorial objects, perhaps according to some natural statistic on the set. Many of these examples generalize a res ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We use the theory of lexicographic shellability to provide various examples in which the rank of the homology of a Rees product of two partially ordered sets enumerates some set of combinatorial objects, perhaps according to some natural statistic on the set. Many of these examples generalize a
Functorial equations for lexicographic products
, 2002
"... We generalize the main result of [K–K–S] concerning the convex embeddings of a chain Γ in a lexicographic power ∆ Γ. For a fixed nonempty chain ∆, we derive necessary and sufficient conditions for the existence of nonempty solutions Γ to each of the lexicographic functorial equations ( ∆ Γ) ≤0 ≃ Γ ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We generalize the main result of [K–K–S] concerning the convex embeddings of a chain Γ in a lexicographic power ∆ Γ. For a fixed nonempty chain ∆, we derive necessary and sufficient conditions for the existence of nonempty solutions Γ to each of the lexicographic functorial equations ( ∆ Γ) ≤0
Lexicographic Product of Extendable Graphs
"... Abstract. Lexicographic product G◦H of two graphs G andH has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called kextendable. In thi ..."
Abstract
 Add to MetaCart
Abstract. Lexicographic product G◦H of two graphs G andH has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k
Results 1  10
of
233