In this survey we overview known results on the strong subgraph [Formula: see text]-connectivity and text]-arc-connectivity of digraphs. After an introductory section, paper is divided into four sections: basic results, algorithms complexity, sharp bounds for text]-(arc-)connectivity, minimally text]-(arc-) connected This contains several conjectures open problems further study.

In this work, we analyse the performance of different density-based algorithms on short-text and narrow domain short-text corpora. We attempt to determine to what extent the features of this kind of corpora impact on the density computation of the clusterings obtained and how robust these algorithms to the different complexity levels are.

Entity Recognition is an essential part of Information Extraction, where explicitly available information and relations are extracted from the entities within the text. Plethora of information is available in social media in the form of text and due to its nature of free style representation, it introduces much complexity while mining information out of it. This complexity is enhanced more by r...

Text simplification is the process of reducing the lexical and syntactic complexity of a text while attempting to preserve (most of) its information content. It has recently emerged as an important research area, which holds promise for enhancing the text readability for the benefit of a broader audience as well as for increasing the performance of other applications. Our work focuses on syntac...

We calculate the holographic complexity of a family hyperbolic black holes in an Einstein-Maxwell-dilaton system by applying $\text{complexity}=\text{action}$ conjecture. While people previously studied spherical same system, we show that have intriguing features. confirm expression mainly depends on spacetime causal structure despite rich thermodynamics. The nontrivial neutral limit exists onl...

Language complexity is an intriguing phenomenon argued to play an important role in both language learning and processing. The need to compare languages with regard to their complexity resulted in a multitude of approaches and methods, ranging from accounts targeting specific structural features to global quantification of variation more generally. In this paper, we investigate the degree to wh...

In this pa per we present an automatic text simplification system for Spanish which intends to make texts more accessible for users with cognitive disabilities. This system aims at reducing the structural complexity of Spanish sentences in that it converts complex sentences in two or more simple sentences and therefore reduces reading difficulty.

Assuming that k and Pk does not have p measure it is shown that BP k P k This implies that the following conditions hold if P does not have p measure i AM co AM is low for P Thus BPP and the graph isomor phism problem are low for P ii If P PH then NP does not have polynomial size circuits This research was supported in part by National Science Foundation Grant CCR with matching funds from Rockw...

In this paper, we present a comparative analysis of statistically predictive syntactic features of complexity and the treatment of these features by humans when simplifying texts. To that end, we have used a list of the most five statistically predictive features obtained automatically and the Corpus of Basque Simplified Texts (CBST) to analyse how the syntactic phenomena in these features have...

A skew estimation algorithm for printed and handwritten documents, based on the document’s horizontal projection profile and its Wigner–Ville distribution, is presented. The proposed algorithm is able to correct skew angles that range between 289 and þ898 detecting the right oriented position of the page by the alternations of the horizontal projection profile. It is able of processing successf...