Constructing common base domain by cues from Voronoi diagram

2012 ◽  
Vol 74 (4) ◽  
pp. 152-163 ◽  
Author(s):  
Tsz-Ho Kwok ◽  
Yunbo Zhang ◽  
Charlie C.L. Wang
2019 ◽  
Vol 86 ◽  
pp. 53-61
Author(s):  
N. G. Topolskiy ◽  
◽  
A. V. Mokshantsev ◽  
To Hoang Thanh ◽  
◽  
...  

2021 ◽  
Vol 143 (1) ◽  
pp. 51-111
Author(s):  
Michail L. Kotin

Abstract The German dative case from genealogic and diachronic perspective. A language-change study about the third case. The dative case belongs to the so-called syncretistic cases, i. e., it encodes multiple functions inherited from the Indo-European cases locative, instrumental, ablative and dative. The paper aims to show the emergence of diverse case functions formally encoded by the dative case from a common base which is assumed to have the locative semantics. The decisive point was, according to the hypothesis, the development of the directional function towards the object or away from it. The addressee dative arose as a result of a specific reanalysis of movement semantics. The so-called dative of subject emerged from reanalysis of the subject-related experiencer function.


2021 ◽  
Vol 50 ◽  
pp. 101301
Author(s):  
A.Z. Zheng ◽  
S.J. Bian ◽  
E. Chaudhry ◽  
J. Chang ◽  
H. Haron ◽  
...  

2015 ◽  
Vol 07 (02) ◽  
pp. 1550019
Author(s):  
Jinyu Huang

A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity) is in NC2, provided that there are polynomial number of common bases (basic matroid parity sets). For graphic matroids, we show that finding a common base for matroid intersection is in NC2, if the number of common bases is polynomial bounded. To our knowledge, these algorithms are the first deterministic NC algorithms for matroid intersection and matroid parity. We also give a new RNC2 algorithm that finds a common base for graphic matroid intersection. We prove that if there is a black-box NC algorithm for Polynomial Identity Testing (PIT), then there is an NC algorithm to determine the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity).


Sign in / Sign up

Export Citation Format

Share Document