In this paper we introduce a new algorithm skillful to build a scheme suitable for Information Dissemination issue. This approach will be very scalable for data dissemination in ad hoc wireless networks in terms of network and device resources. The scheme is characterized by a backbone created through a reduced set of mobile node, able to disseminate the information to whole network; that backb...

An important problem in Question Answering over Knowledge Bases is to interpret a question into a database query. This problem can be formulated as an instance of semantic parsing where a natural language utterance is analyzed into a (possibly executable) meaning representation. Most semantic parsing strategies for Question Answering use models with limited expressiveness because it is difficul...

Typically, decision tree construction algorithms apply a single \goodness of split" criterion to form each test node of the tree. It is a hypothesis of this research that better results can be obtained if during tree construction one applies a split criterion suited to the \location" of the test node in the tree. Speciically, given the objective of maximizing predictive accuracy, test nodes nea...

This paper proposes an Ant algorithm implemented with stack count for the purpose of designing suffix representations of tree structures. The algorithm is applied to the problem of reconstructing an evolutionary tree from nucleotide sequences. The algorithm shows compatible results in simulated experiment and alignment of protein sequences from 15 species against the existing algorithms.

In this paper we describe a simple and efficient algorithm to construct FRT embeddings (optimal probabilistic tree embeddings) on graphs. For a graph with n vertices and m edges the algorithm runs in O(m log n + n log n) time. With the efficient FRT construction, we show that FRT trees are Ramsey partitions with asymptotically tight bound, and we give tighter bounds on coefficient than previous...