Search results for "Search engine"
showing 10 items of 121 documents
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
1998
The Minimal Consistent Subset Selection (MCSS) problem is a discrete optimization problem whose resolution for large scale instances requires a prohibitive processing time. Prior algorithms addressing this problem are presented. Randomization and approximation techniques are suitable to face the problem, then random search and meta-heuristics are proposed and consequently Tabu Search strategies are applied and evaluated. Parallel computing helps to reduce processing time and/or produce better results; different approaches for designing parallel tabu search are analyzed.
UCS: Ultimate course search
2016
International audience; In this system prototype demonstration we present, Ultimate Course Search (UCS), a learning tool developed to provide students ways to efficiently search electronic educational materials. UCS integrates slides, lecture videos and textbooks into a single platform. The keywords extracted from the textbooks and the slides are the basis of the indexing scheme. For the videos, UCS relies on slide transitions and metadata to establish the correspondence between slides and video segments. The video segmentation is based on the slides being presented using the meta-data provided by the video recording software and image processing techniques.
A Fast Anchor Person Searching Scheme in News Sequences
2001
In this paper we address the problem of seeking anchor person shots in news sequences. This can be useful since usually this kind of scenes contain important and reusable information such as interviews. The proposed technique is based on our a priori knowledge of the editing techniques used in news sequences.
Indexing Multimedia Learning Materials in Ultimate Course Search
2016
International audience; Multimedia is the main support for online learning materials and the size of multimedia learning materials is growing with the popularity of online programs offered by Universities. Ultimate Course Search (UCS) is a tool that aims to provide efficient search of course materials. UCS integrates slides, lecture videos and textbook content into a single platform with search capabilities. The keywords extracted from the textbook index and the power-point slides are the basis of the indexing scheme. The slides are indexed on the keywords and the videos are indexed on the slides. The correspondence between the slides and video segments is established using the meta-data pr…
Map of the visibility and search engine positioning of the main Spanish media groups
2020
Este trabajo analiza la visibilidad y posicionamiento en buscadores de los sitios web de los principales grupos de comunicación españoles. Se compara su visibilidad web y su presencia en los resultados de búsqueda de Google a través de programas de análisis SEO y una metodología propia que se ha denominado Índice de Visibilidad Agregada. Se ha realizado un análisis comparativo de los grupos Atresmedia, COPE, Godó, Hearst Magazines, Henneo, Imagina Media Audiovisual, Intereconomía Corporación, Joly, Mediaset España Comunicación, Planeta, Prensa Ibérica, Prisa, Unidad Editorial, Vocento y Zeta. Se ha podido establecer que Unidad Editorial es el grupo con mayor tráfico web proveniente de búsqu…
A neural multi-agent based system for smart html pages retrieval
2003
A neural based multi-agent system for smart HTML page retrieval is presented. The system is based on the EalphaNet architecture, a neural network capable of learning the activation function of its hidden units and having good generalization capabilities. System goal is to retrieve documents satisfying a query and dealing with a specific topic. The system has been developed using the basic features supplied by the Jade platform for agent creation, coordination and control. The system is composed of four agents: the trainer agent, the neural classifier mobile agent, the interface agent, and the librarian agent. The sub-symbolic knowledge of the neural classifier mobile agent is automatically …
Complex dynamics of our economic life on different scales: insights from search engine query data.
2010
Search engine query data deliver insight into the behaviour of individuals who are the smallest possible scale of our economic life. Individuals are submitting several hundred million search engine queries around the world each day. We study weekly search volume data for various search terms from 2004 to 2010 that are offered by the search engine Google for scientific use, providing information about our economic life on an aggregated collective level. We ask the question whether there is a link between search volume data and financial market fluctuations on a weekly time scale. Both collective ‘swarm intelligence’ of Internet users and the group of financial market participants can be rega…
Lightweight BWT Construction for Very Large String Collections
2011
A modern DNA sequencing machine can generate a billion or more sequence fragments in a matter of days. The many uses of the BWT in compression and indexing are well known, but the computational demands of creating the BWT of datasets this large have prevented its applications from being widely explored in this context. We address this obstacle by presenting two algorithms capable of computing the BWT of very large string collections. The algorithms are lightweight in that the first needs O(m log m) bits of memory to process m strings and the memory requirements of the second are constant with respect to m. We evaluate our algorithms on collections of up to 1 billion strings and compare thei…
Lightweight algorithms for constructing and inverting the BWT of string collections
2013
Recent progress in the field of \{DNA\} sequencing motivates us to consider the problem of computing the Burrows‚ÄìWheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the \{BWT\} at their heart, and it would be of great interest to explore their applications to sequence collections such as these. However, computing the \{BWT\} for 100 billion characters or more of data remains a computational challenge. In this work we ad…
Interactive Gradually Generating Relevance Query Refinement Under the Human-Mediated Scenario in Multilingual Settings
2016
As opposed to query modelling, relevance generating interactive query refinement (QR) is a technique aimed at exploiting syntax variations of gradually extended, being removed or replaced with some other keywords query, which depending on the factors like e.g. the information resource, the database structure, or the keyword alignment, facilitates significantly the searching process. Therefore our motivation is to explore the dynamism of the precision trend depended upon the factors analyzed. For a couple of language pairs which constitute multilingual settings, we develop a user-centred framework that imposes distributed search optimization. Our data set contains variety of query types subm…