Results 221 to 230 of about 17,095 (248)
Some of the next articles are maybe not open access.
Score normalization for keyword search
2016 24th Signal Processing and Communication Application Conference (SIU), 2016In this work, keyword search (KWS) is based on a symbolic index that uses posteriorgram representation of the speech data. For each query, sum-to-one normalization or keyword specific thresholding is applied to the search results. The effect of these methods on the proposed KWS system is investigated.
Leda Sari, Murat Saraclar
openaire +1 more source
Peer-to-peer keyword search using keyword relationship
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., 2003Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither any centralized directory nor any centralized management of overlay network topology and data placement.
Kiyohide Nakauchi +3 more
openaire +1 more source
Using proxies for OOV keywords in the keyword search task
2013 IEEE Workshop on Automatic Speech Recognition and Understanding, 2013We propose a simple but effective weighted finite state transducer (WFST) based framework for handling out-of-vocabulary (OOV) keywords in a speech search task. State-of-the-art large vocabulary continuous speech recognition (LVCSR) and keyword search (KWS) systems are developed for conversational telephone speech in Tagalog. Word-based and phone-based
Guoguo Chen +4 more
openaire +1 more source
Oblivious Keyword Search with Authorization
2016Oblivious keyword search OKS allows a user to search and retrieve the data associated with a chosen keyword in an oblivious way. The database supplier issues a trapdoor used for searching of a specific keyword chosen by the user while learns nothing about this keyword.
Peng Jiang 0007 +4 more
openaire +2 more sources
Fast multiple keyword searching
1992A new multiple keyword searching algorithm is presented as a generalization of a fast substring matching algorithm based on an n-gram technique. The expected searching time complexity is shown to be O((N/m+ml) log lm) under reasonable assumptions about the keywords together with the assumption that the text is drawn from a stationary ergodic source ...
Jong Yong Kim, John Shawe-Taylor
openaire +1 more source
ABDKS: attribute-based encryption with dynamic keyword search in fog computing
Frontiers of Computer Science, 2021Fei Meng +2 more
exaly
Keyword decisions in sponsored search advertising: A literature review and research agenda
Information Processing and Management, 2023Yanwu Yang, Huiran Li
exaly
ABKS-SKGA: Attribute-based keyword search secure against keyword guessing attack
Computer Standards and Interfaces, 2021Jiguo Li, Yang Lu, Yichen Zhang
exaly
VRFMS: Verifiable Ranked Fuzzy Multi-keyword Search over Encrypted Data
IEEE Transactions on Services Computing, 2022Xinghua Li, Qiuyun Tong, Jinwei Zhao
exaly