Results 51 to 60 of about 645,367 (188)
Two Classical Queries versus One Quantum Query [PDF]
, 1998 In this note we study the power of so called query-limited computers. We compare the strength of a classical computer that is allowed to ask two questions to an NP-oracle with the strength of a quantum computer that is allowed only one such query.
van Dam, Wim
core +2 more sources
IEEE AccessQuery-by-example spoken term detection (QbE-STD) refers to the search for an audio query in a repository of audio utterances. A common approach for QbE-STD involves computing a matching matrix between the feature representations of the query and the ...
Manisha Naik Gaonkar +3 more
doaj +1 more source
Adaptive Hierarchical Clustering Using Ordinal Queries
, 2018 In many applications of clustering (for example, ontologies or clusterings of animal or plant species), hierarchical clusterings are more descriptive than a flat clustering.
Emamjomeh-Zadeh, Ehsan, Kempe, David
core +1 more source
A study of query by semantic example [PDF]
2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008 In recent years, query-by-semantic-example (QBSE) has become a popular approach to do content based image retrieval. QBSE extends the well established query-by-example retrieval paradigm to the semantic domain. While various authors have pointed out the benefits of QBSE, there are still various open questions with respect to this paradigm.
Nikhil Rasiwasia, Nuno Vasconcelos
openaire +1 more source
Info Navigator: A visualization tool for document searching and browsing [PDF]
, 2003 In this paper we investigate the retrieval performance of monophonic and polyphonic queries made on a polyphonic music database. We extend the n-gram approach for full-music indexing of monophonic music data to polyphonic music using both rhythm and ...
Carey, Matthew +2 more
core +3 more sources
Learning Visual Features from Snapshots for Web Search
, 2017 When applying learning to rank algorithms to Web search, a large number of features are usually designed to capture the relevance signals. Most of these features are computed based on the extracted textual elements, link analysis, and user logs. However,
Cheng, Xueqi +5 more
core +1 more source
DATA REFINEMENT APPROACH FOR ANSWERING WHY-NOT PROBLEM OVER K-MOST PROMISING PRODUCT (K-MPP) QUERIES
JUTI: Jurnal Ilmiah Teknologi Informasi, 2018 K-Most Promising (K-MPP) product is a strategy for selecting a product that used in the process of determining the most demanded products by consumers.
Vynska Amalia Permadi +2 more
doaj +1 more source
Adapting to the Shifting Intent of Search Queries [PDF]
, 2009 Search engines today present results that are often oblivious to abrupt shifts in intent. For example, the query `independence day' usually refers to a US holiday, but the intent of this query abruptly changed during the release of a major film by that ...
Mishra, Nina +2 more
core +2 more sources
A Smart Web-Based Geospatial Data Discovery System with Oceanographic Data as an Example
ISPRS International Journal of Geo-Information, 2018 Discovering and accessing geospatial data presents a significant challenge for the Earth sciences community as massive amounts of data are being produced on a daily basis. In this article, we report a smart web-based geospatial data discovery system that
Yongyao Jiang +9 more
doaj +1 more source
A Novel Pedestrian Reidentification Method Based on a Multiview Generative Adversarial Network
IEEE Access, 2020 Emerging deep learning (DL) techniques have greatly improved pedestrian reidentification (PRI) performance. However, the existing DL-based PRI methods cannot learn robust feature representations owing to the single view of query images and the limited ...
Jifeng Guo +4 more
doaj +1 more source