• No se han encontrado resultados

[PDF] Top 20 Efficient similarity search on multimedia databases

Has 10000 "Efficient similarity search on multimedia databases" found on our website. Below are the top 20 most common "Efficient similarity search on multimedia databases".

Efficient similarity search on multimedia databases

Efficient similarity search on multimedia databases

... retrieving multimedia data has received increasing attention with the advent of cloud storage ...by similarity over large data collections is mandatory to improve storage and user ...approximate ... See full document

10

Stream processing to solve image search by similarity

Stream processing to solve image search by similarity

... large databases, it is not feasible to conduct a thorough search to a ...based on compact partitions and based on pivots. In the indexes based on compact partitions a set of objects ... See full document

7

Índice aproximado probabilístico para la búsqueda por proximidad en memoria secundariaAproximate probabilistic index for the search of similarity in secondary memory

Índice aproximado probabilístico para la búsqueda por proximidad en memoria secundariaAproximate probabilistic index for the search of similarity in secondary memory

... recognition, multimedia reco- very, biometric identification, ...focus on the more general model for solving the problem that is based on the notion of metric space, where the only information ... See full document

84

A computationally efficient reduced order model to generate multi-parameter fluid-thermal databases

A computationally efficient reduced order model to generate multi-parameter fluid-thermal databases

... depends on: (a) the ROM itself and (b) the selection of the snap- ...the search for a combi- nation of database points that yields the POD manifold that contains the information required to fi ll in the ... See full document

9

Dynamic selection of suitable pivots for similarity search in metric spaces

Dynamic selection of suitable pivots for similarity search in metric spaces

... collection. Several heuristics have been proposed for the selection of pivots, as if the distance function is continuous or discrete. In [7] pivots are objects that maximize the sum of distances among them. In [10] a ... See full document

10

Métodos semánticos para la recuperación de información en grandes volúmenes de datos: una Aquitectura Escalable y Eficiente

Métodos semánticos para la recuperación de información en grandes volúmenes de datos: una Aquitectura Escalable y Eficiente

... Approximate similarity search algorithms based on hashing were proposed to query high-dimensional datasets due to its fast re- trieval speed and low storage ...and efficient solution to index ... See full document

130

Spatial selection of sparse pivots for similarity search in metric spaces

Spatial selection of sparse pivots for similarity search in metric spaces

... depend on the size of the collection, but in the intrinsic dimensionality of the metric ...depending on the dimensionality of the space, the number of chosen pivots should grow quickly when the first ... See full document

6

Knowledge Insertion: an Efficient Approach to Reduce Search Effort in Evolutionary Scheduling

Knowledge Insertion: an Efficient Approach to Reduce Search Effort in Evolutionary Scheduling

... blind search algorithms, which only make use of the relative fitness of solutions, but completely ignore the nature of the ...large search spaces a considerable number of evaluations are required to arrive ... See full document

6

Efficient analytical queries on semantic web data cubes

Efficient analytical queries on semantic web data cubes

... twofold: On the one hand, we want to compare our approach against other one(s) that are aimed at querying OLAP cubes on the ...web. On the other hand, we look for the best possi- ble combinations of ... See full document

20

Efficient locomotion on non-wheeled snake-like robot

Efficient locomotion on non-wheeled snake-like robot

... Friction coefficients make the robot to generate larger friction forces in the normal direction than in the tangential direction of the motion. Considering C T = 12 , C N = 20 and the mass of each snake’s link in m = ... See full document

6

On decision tree induction for knowledge discovery in very large databases

On decision tree induction for knowledge discovery in very large databases

... thedata across the different branches of the root attribute. Thus, the algorithm in general requirestwo passes over the data per level of the decision tree in the worst case... 3 .? The [r] ... See full document

127

Ampliación de las estrategias de consejería y prueba del VIH: desafíos técnicos y tensiones ético-políticas

Ampliación de las estrategias de consejería y prueba del VIH: desafíos técnicos y tensiones ético-políticas

... HIV transmission. The contemplation of individual and sociocultural characteristics reinforces the confidence of HIV seropositive people in ART and contributes to voluntary testing being perceived as sensitive and ... See full document

12

Efficient OpenCL-based concurrent tasks offloading on accelerators

Efficient OpenCL-based concurrent tasks offloading on accelerators

... Table 1 resumes the selected real tasks for the experiments alongside their classification as dom- inant kernel tasks (DK) or dominant transfer tasks (DT). These tasks have been selected from NVIDIA and AMD OpenCL SDK ... See full document

5

jhtp5_07.ppt

jhtp5_07.ppt

... 77 // method to perform binary search of an array 78 public int binarySearch( int array2[], int key ) 79 { 80 int low = 0; // low element index 81 int high = array2.length - 1; // high element index 82 int middle; ... See full document

70

From cluster databases to cloud storage: Providing transactional support on the cloud

From cluster databases to cloud storage: Providing transactional support on the cloud

... ]. On the contrary, our proposal can also serve to support both OLTP and OLAP in an integrated ...system. On the one hand, OLTP processes can run under different service level agreements according to their ... See full document

210

Perceptual color similarity measurement

Perceptual color similarity measurement

... color similarity proposed in previous section was the result of experiments and adjustments to the configuration parameters of formula ...(or on the contrary, rather short) number of colors and a ... See full document

79

Databases: introduction to relational databases SQL, UML, XML / Rodrigo García Carmona

Databases: introduction to relational databases SQL, UML, XML / Rodrigo García Carmona

... HOW TO CREATE TABLES USING SQL CREATE TABLE students id INTEGER NOT NULL, name VARCHAR255 UNIQUE NOT NULL, score FLOAT, photo BLOB, PRIMARY KEYid ; CREATE TABLE universities name VARCH[r] ... See full document

30

Time series variability tree for fast light curve retrieval

Time series variability tree for fast light curve retrieval

... Algorithms coming from the machine learning community are not designed to work with this kind of data. Therefore, light curves have to be transformed into vector-like data before being passed to classifiers. ... See full document

55

BÚSQUEDA DE PREDICADOS DIFUSOS EN UNA BASE DE DATOS UTILIZANDO METAHEURÍSTICAS  / SEARCH OF FUZZY PREDICATES IN DATABASES USING METAHEURISTICS

BÚSQUEDA DE PREDICADOS DIFUSOS EN UNA BASE DE DATOS UTILIZANDO METAHEURÍSTICAS / SEARCH OF FUZZY PREDICATES IN DATABASES USING METAHEURISTICS

... in databases and they are focused on a certain model (rules, groups, ...of databases. The presented method is based on the paradigm of predicates logic and the calculation of its values using ... See full document

11

Persona as a tool to involving human in Agile methods: contributions from HCI and marketing

Persona as a tool to involving human in Agile methods: contributions from HCI and marketing

... Regarding to the phase in the agile development process where persona was applied, we identified two moments that we referred to as the Exploratory phase and the Refinement phase. During the Exploratory phase, personas ... See full document

8

Show all 10000 documents...