Results 41 to 50 of about 10,214,423 (243)
Similarly to other European countries, the history of the Roma population in Croatian areas was marked mostly by most periods of persecution and suffering, when the authorities tried to use repression in order to assimilate the Roma into the majority ...
Danijel Vojak
doaj +1 more source
Do We Need a (New) Theory of Lexicography?
In the current transition from printed to electronic dictionaries the question has been raised whether we need a new theory of lexicography that may guide the conception and production of lexicographical e-tools or if we can use the theories already ...
Sven Tarp
doaj +1 more source
LEXICOGRAPHIC REPRESENTATION OF PSYCHOLINGUISTIC MEANING OF THE WORD
This article discusses the various variants of lexicographical description of psycholinguistic meaning. The purpose of lexicographical description of psycholinguistic meaning is to present experimentally obtained psycholinguistic description of the ...
Joseph Abramovich Sternin
doaj +1 more source
Sums of lexicographically ordered sets
Given a set \(A=\{a_ 1,..,a_ n\}\) of distinct positive integers where \(a_ ...
M. D. Atkinson +2 more
openaire +1 more source
Monolingual alignment of word senses and definitions in lexicographical resources
Dictionaries are fundamental resources for people to learn and document languages as well as for computers to process natural languages. A dictionary provides a fine-grained structure and description of the vocabulary of a language.
Ahmadi, Sina
core +1 more source
This article is the written version of the Enrique Alcaraz Annual Memorial Lecture, given by the author at the University of Alicante on March 26, 2014.
Tarp, Sven
doaj +1 more source
Strong Nash Equilibria in Games with the Lexicographical Improvement Property [PDF]
We introduce a class of finite strategic games with the property that every deviation of a coalition of players that is profitable to each of its members strictly decreases the lexicographical order of a certain function defined on the set of strategy ...
Harks, Tobias +5 more
core +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Lexicographical separation in Rn
We prove a new separation theorem for any two subsets of Rn with disjoint convex hulls, by linear operators, or isomorphisms, or isometries, in the sense of the lexicographical order of Rn (or, equivalently, by “generalized half spaces”).
Martínez-Legaz, Juan-Enrique +3 more
core +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source

