Mostrando recursos 1 - 3 de 3

  1. ConceptRank : extractive summarization basede on graph conceptual centrality as salience

    Ramos, Ana Maria Schwendler
    Since the access to information is increasing everyday and we can easily acquire knowledge from many resources such as news websites, blogs and social networks, the capacity of processing all this amount of information becomes increasingly difficult. So, a way to deal with this situation is automatically extract the most important sentences, aiming to reduce the amount of text into a shorter version. We can explore this process while preserving the core information content by using a process called Automatic Text Summarization. This work presents a proposal to minimize problems related to the automatic summarization of texts, since some extractive...
    (application/pdf) - 17-mar-2017

  2. Soluções open source para interoperabilidade entre sistemas de videoconferência e Webconferência

    Santos, Alexandre Kreismann dos
    Sistemas de videoconferência permitem a comunicação por áudio e vídeo em tempo real e, devido a crescente qualidade das redes de banda larga, vêm apresentando um aumento significativo de uso, em que aulas, palestras, treinamentos e outros tipos de reuniões cada vez mais usufruem dessa tecnologia. É possível dividir tais sistemas em quatro grandes grupos: sistemas de webconferência, que são executados em um navegador web; sistemas desktop que requerem a instalação em um computador; e, finalmente, os de hardware dedicado, que podem ser sistemas de videoconferência de sala ou sistemas de telepresença. Embora cada grupo tenha o seu foco de...
    (application/pdf) - 17-mar-2017

  3. Fast extract with cube hashing

    Schmitt, Bruno de Oliveira
    The fast-extract algorithm is a well-known algebraic method for factoring and decomposing Boolean expressions. Since it uses pairwise comparisons between cubes to find factors, the run-time is degraded for networks whose primary outputs are expressed in terms of primary inputs and have Boolean functions with thousands of cubes. This work describes a new implementation of the fast-extract algorithm, fxch, having complexity linear in the number of cubes. The reduction in complexity is achieved by hashing sub-cubes and using the hash table to find good factors to extract. Experimental results on industrial benchmarks show better run-time and scalability of the proposed...
    (application/pdf) - 04-feb-2017

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.