Add to ORKGIn order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.Facultad de Informátic
We describe mts, a generic framework for parallelizing certain types of tree search programmes inclu...
This thesis is considered with the parallelisation of solvers which search for either an arbitrary, ...
Most similarity search techniques map the data objects into some high-dimensional feature space. The...
In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to us...
In this paper we describe the parallelization of a data structure used to perform multimedia web sea...
Web Engines are a useful tool for searching information in the Web. But a great part of this inform...
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algo...
Access methods are a fundamental tool on Information Retrieval. However, most of these methods suff...
Many computational applications need to look for information in a database. Nowadays, the predominan...
We present space-efficient parallel strategies for two fundamental combinatorial search problems, na...
In this project, we introduce and present a new search method for fast nearest-neighbor search in hi...
. We present a new parallel tree search method for ønding one solution to a constraint satisfaction ...
Abstract. We present space-efficient parallel strategies for two fundamental combinatorial search pr...
Most similarity search techniques map the data objects into some high-dimensional feature space. The...
Combinatorial search is central to many applications yet hard to parallelise. We argue for improving...
We describe mts, a generic framework for parallelizing certain types of tree search programmes inclu...
This thesis is considered with the parallelisation of solvers which search for either an arbitrary, ...
Most similarity search techniques map the data objects into some high-dimensional feature space. The...
In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to us...
In this paper we describe the parallelization of a data structure used to perform multimedia web sea...
Web Engines are a useful tool for searching information in the Web. But a great part of this inform...
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algo...
Access methods are a fundamental tool on Information Retrieval. However, most of these methods suff...
Many computational applications need to look for information in a database. Nowadays, the predominan...
We present space-efficient parallel strategies for two fundamental combinatorial search problems, na...
In this project, we introduce and present a new search method for fast nearest-neighbor search in hi...
. We present a new parallel tree search method for ønding one solution to a constraint satisfaction ...
Abstract. We present space-efficient parallel strategies for two fundamental combinatorial search pr...
Most similarity search techniques map the data objects into some high-dimensional feature space. The...
Combinatorial search is central to many applications yet hard to parallelise. We argue for improving...
We describe mts, a generic framework for parallelizing certain types of tree search programmes inclu...
This thesis is considered with the parallelisation of solvers which search for either an arbitrary, ...
Most similarity search techniques map the data objects into some high-dimensional feature space. The...