Results 11 to 20 of about 645,367 (188)
EURASIP Journal on Advances in Signal Processing, 2010 We describe a novel query-by-example (QBE) approach in music information retrieval that allows a user to customize query examples by directly modifying the volume of different instrument parts.
Goto Masataka +4 more
doaj +2 more sources
Analisis Seleksi Citra Mirip dengan Memanfaatkan Konsep CBIR dan Algoritma Threshold
ComTech, 2011 Content base image retrieval (CBIR) is the concept of image retrieval by comparing the existing image on the sample to that of the database (query by example).
Abdul Haris Rangkuti
doaj +1 more source
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018 This paper describes Fuzzy Query By Example, an approach helping users retrieve data without any prior knowledge of the database schema or any formal querying language. The user is solicited to evaluate, in a binary way, pre-selected items of the database.
Moreau, Aurélien +2 more
openaire +2 more sources
Separations in Query Complexity Based on Pointer Functions [PDF]
, 2015 In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates
Ambainis, Andris +5 more
core +3 more sources
ALBAYZIN Query-by-example Spoken Term Detection 2016 evaluation
EURASIP Journal on Audio, Speech, and Music Processing, 2018 Query-by-example Spoken Term Detection (QbE STD) aims to retrieve data from a speech repository given an acoustic (spoken) query containing the term of interest as the input.
Javier Tejedor +9 more
doaj +1 more source
EURASIP Journal on Audio, Speech, and Music Processing, 2019 The huge amount of information stored in audio and video repositories makes search on speech (SoS) a priority area nowadays. Within SoS, Query-by-Example Spoken Term Detection (QbE STD) aims to retrieve data from a speech repository given a spoken query.
Javier Tejedor +6 more
doaj +1 more source
Performance of Graph and Relational Databases in Complex Queries
Applied Sciences, 2022 In developing NoSQL databases, a major motivation is to achieve better efficient query performance compared with relational databases. The graph database is a NoSQL paradigm where navigation is based on links instead of joining tables.
Petri Kotiranta +2 more
doaj +1 more source
Partial-sum queries in OLAP data cubes using covering codes [PDF]
, 1997 A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish a connection between the covering problem in the theory of error-correcting codes and the partial-sum problem and use this connection to devise ...
Ching-tien Ho +4 more
core +3 more sources
Text-Image Matching for Cross-Modal Remote Sensing Image Retrieval via Graph Neural Network
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 The rapid development of remote sensing (RS) technology has produced massive images, which makes it difficult to obtain interpretation results by manual screening. Therefore, researchers began to develop automatic retrieval method of RS images. In recent
Hongfeng Yu +6 more
doaj +1 more source
Ranking Large Temporal Data [PDF]
, 2012 Ranking temporal data has not been studied until recently, even though ranking is an important operator (being promoted as a firstclass citizen) in database systems.
Jestes, Jeffrey +3 more
core +3 more sources