Recently a new so-called energy complexity measure has been introduced and studied for feedforward perceptron networks. This measure is inspired by the fact that biological neurons require more energy to transmit a spike than not to fire, and the activity of neurons in the brain is quite sparse, with only about 1% of neurons firing. In this letter, we investigate the energy complexity of recurr...

In this paper an approach to automatic text location and identification on colored book and journal covers is proposed. To reduce the amount of small variations in color, a clustering algorithm is applied in a preprocessing step. Two methods have been developed for extracting text hypotheses. One is based on a top-down analysis using successive splitting of image regions. The other is a bottom-...

In this paper, we propose a robust approach for text extraction and recognition from Arabic news video sequence. The text included in video sequences is an important needful for indexing and searching system. However, this text is difficult to detect and recognize because of the variability of its size, their low resolution characters and the complexity of the backgrounds. To solve these proble...

Text localization from scene images is a challenging task that finds application in many areas. In this work, we propose a novel hybrid text localization approach that exploits Multi-resolution Maximally Stable Extremal Regions to discard false-positive detections from the text confidence maps generated by a Fast Feature Pyramid based sliding window classifier. The use of a multi-scale approach...

We describe a method that will reconstruct an unrooted binary phylogenetic level-1 network on [Formula: see text] taxa from the set of all quartets containing a certain fixed taxon, in [Formula: see text] time. We also present a more general method which can handle more diverse quartet data, but which takes [Formula: see text] time. Both methods proceed by solving a certain system of linear equ...

Open-Domain Question Answering systems (QA) performs the task of detecting text fragments in a collection of documents that contain the response to user’s queries. These systems use high complexity tools that reduce its applicability to the treatment of small amounts of text. Consequently, when working on large document collections, QA systems apply Information Retrieval (IR) techniques to redu...

The longitudinal effects of repeating a timed writing activity on English as a Foreign Language (EFL) students’ second language (L2) writing development were investigated. Data for 46 students in two university classes (23 in each class), each with a different course objective, were collected 30 times in the same way over one year. The students’ compositions were analyzed for fluency, grammatic...

Extracting biomedical relations such as drug-drug interaction (DDI) from text is an important task in biomedical NLP. Due to the large number of complex sentences in biomedical literature, researchers have employed some sentence simplification techniques to improve the performance of the relation extraction methods. However, due to difficulty of the task, there is no noteworthy improvement in t...

The problem of analysing dynamically evolving textual data has recently arisen. An example of such data is the discussion appearing in Internet chat lines. In this paper a recently introduced source separation method, termed as complexity pursuit, is applied to the problem. The method is a generalisation of projection pursuit to time series and it is able to use both spatial and temporal depend...

RSA, ESIGN, cryptography, digital signature, encryption, decryption, factoring RSA [1] generates digital signatures and cipher text, S, by performing exponentiation on a message, M, to the e-th power of the form M mod(n), where n is based on large prime numbers. RSA has been proven to be fundamentally secure, given the complexity of the e-th root mod(n) problem that RSA presents. Unfortunately,...