Results 11 to 20 of about 34,006 (164)

Concatenating Bipartite Graphs

open access: yesThe Electronic Journal of Combinatorics, 2022
Let $x,y\in (0,1]$, and let $A,B,C$ be disjoint nonempty stable subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$, and there are no edges between $A,C$.
Maria Chudnovsky   +4 more
openaire   +3 more sources

Concatenated Polar codes [PDF]

open access: yes2010 IEEE International Symposium on Information Theory, 2010
Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that for current constructions the probability of error decays sub-exponentially in the block-length (more detailed ...
Mayank Bakshi   +2 more
openaire   +3 more sources

Non-parametric algorithm to isolate chunks in response sequences

open access: yesFrontiers in Behavioral Neuroscience, 2016
Chunking consists in grouping items of a sequence into small clusters, named chunks, with the assumed goal of lessening working memory load. Despite extensive research, the current methods used to detect chunks, and to identify different chunking ...
Andrea Alamia   +3 more
doaj   +1 more source

Improving Recognition of SIBI Gesture by Combining Skeleton and Hand Shape Features

open access: yesJurnal Ilmu Komputer dan Informasi, 2022
SIBI (Sign System for Indonesian Language) is an official sign language system used in school for hearing impairment students in Indonesia. This work uses the skeleton and hand shape features to classify SIBI gestures.
Erdefi Rakun, Noer FP Setyono
doaj   +1 more source

Using PhyloSuite for molecular phylogeny and tree‐based analyses

open access: yesiMeta, 2023
Phylogenetic analysis has entered the genomics (multilocus) era. For less experienced researchers, conquering the large number of software programs required for a multilocus‐based phylogenetic reconstruction can be somewhat daunting and time‐consuming ...
Chuan‐Yu Xiang   +8 more
doaj   +1 more source

THE BIDETERMINISTIC CONCATENATION PRODUCT [PDF]

open access: yesInternational Journal of Algebra and Computation, 1993
This paper is devoted to the study of the bideterministic concatenation product, a variant of the concatenation product. We give an algebraic characterization of the varieties of languages closed under this product. More precisely, let V be a variety of monoids, [Formula: see text] the corresponding variety of languages and [Formula: see text] the ...
Pin, Jean-Eric, Thérien, Denis
openaire   +3 more sources

Analysis of the dominant mutation N188T of human connexin46 (hCx46) using concatenation and molecular dynamics simulation

open access: yesFEBS Open Bio, 2019
Connexins (Cx) are proteins that form cell‐to‐cell gap junction channels. A mutation at position 188 in the second extracellular loop (E2) domain of hCx46 has been linked to an autosomal dominant zonular pulverulent cataract.
Patrik Schadzek   +3 more
doaj   +1 more source

Synthesis by word concatenation

open access: yes6th European Conference on Speech Communication and Technology, 1999
Verbmobil is a speaker-independent system that offers translation assistance in dialogue situations. In co-operation with other institutes we are developing the speech synthesis module within Verbmobil for German and American English. Current priority is given to an enhancement of naturalness of our PSOLA based concatenative synthesis of German. Due to
Stöber, Karlheinz   +3 more
openaire   +2 more sources

Expandable Spherical Projection and Feature Concatenation Methods for Real-Time Road Object Detection Using Fisheye Image

open access: yesApplied Sciences, 2022
Fisheye lens cameras are widely used in such applications where a large field of view (FOV) is necessary. A large FOV can provide an enhanced understanding of the surrounding environment and can be an effective solution for detecting the objects in ...
Songeun Kim, Soon-Yong Park
doaj   +1 more source

Operational State Complexity of Deterministic Unranked Tree Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic tree automata are
Xiaoxue Piao, Kai Salomaa
doaj   +1 more source

Home - About - Disclaimer - Privacy