Results 31 to 40 of about 680,970 (356)
Learning Acoustic Word Embeddings With Dynamic Time Warping Triplet Networks
IEEE Access, 2020 In the last years, acoustic word embeddings (AWEs) have gained significant interest in the research community. It applies specifically to the application of acoustic embeddings in the Query-by-Example Spoken Term Detection (QbE-STD) search and related ...
Denis Shitov +3 more
doaj +1 more source
Applied Sciences, 2021 The large amount of information stored in audio and video repositories makes search on speech (SoS) a challenging area that is continuously receiving much interest.
Javier Tejedor +4 more
doaj +1 more source
Query by Example in Remote Sensing Image Archive Using Enhanced Deep Support Vector Data Description
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 This article studies remote sensing image retrieval using kernel-based support vector data description (SVDD). We exploit deep SVDD, which is a well-known method for one-class classification to recover the most relevant samples from the archive.
Omid Ghozatlou +2 more
doaj +1 more source
Research on data query and application of obstacle dataset based on spatio-temporal data model
Hangkong gongcheng jinzhan, 2023 The obstacle dataset is a kind of aeronautical information dataset based on the aeronautical information exchange model (AIXM) specification proposed by International Civil Aviation Organization (ICAO) under the aviation intelligence management(AIM ...
LAI Xin, LIANG Changsheng, ZHU Meiling
doaj +1 more source
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
CNN Based Query by Example Spoken Term Detection
Interspeech, 2018 In this work, we address the problem of query by example spoken term detection (QbE-STD) in zero-resource scenario. State of the art solutions usually rely on dynamic time warping (DTW) based template matching.
Dhananjay Ram +2 more
semanticscholar +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
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