Results 51 to 60 of about 9,133,272 (216)
History, EarlyView.Abstract Participants in Russia's 1825 Decembrist uprising against the Tsarist regime were, quite literally, a case study in French cultural influence upon Russia. This is particularly true as it relates to Russia's emotional cultures. Although this has not, traditionally, been the primary focus of historical analysis of this event (in Soviet or ...
ADAM COKER
wiley +1 more source
Choice by lexicographic semiorders [PDF]
, 2009 In Tversky’s (1969) model of a lexicographic semiorder, a preference is generated via the sequential application of numerical criteria by declaring an alternative x better than an alternative y if the first criterion that distinguishes between x and y ...
Paola Manzini (4574845) +3 more
core +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Korrektur og retning som leksikografiske funktioner
Hermes, 2004 Thousands of people, in private or public companies and institutions, are daily engaged in text revision or marking. These people frequently run into problems of different types which can be solved by means of dictionary consultation.
Sven Tarp
doaj +1 more source
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Admissibility and event-rationality [PDF]
, 2013 We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among ...
Galanis, Spyros +3 more
core +1 more source
Kruskal's Tree Theorem for Acyclic Term Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion of simplification order for acyclic term graphs. For this we adapt
Georg Moser, Maria A. Schett
doaj +1 more source
Lexicographic generation of ordered trees
Theoretical Computer Science, 1980 AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes and certain integer sequences, an algorithm for generating these trees lexicographically, and the ranking function and the corresponding unranking procedure.
openaire +2 more sources
Lexicographically Ordered Multi-Objective Clustering
CoRR, 2019 We introduce a rich model for multi-objective clustering with lexicographic ordering over objectives and a slack. The slack denotes the allowed multiplicative deviation from the optimal objective value of the higher priority objective to facilitate improvement in lower-priority objectives. We then propose an algorithm called Zeus to solve this class of
Sainyam Galhotra +2 more
openaire +3 more sources