Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
Robust data retrieval in the presence of uncertainty is a challenging problem in multimedia information retrieval. In query-by-humming (QBH) systems, uncertainty can arise in query...
Erdem Unal, Elaine Chew, Panayiotis G. Georgiou, S...
Now motivated also by the partial support of major search engines, hundreds of millions of documents are being published on the web embedding semi-structured data in RDF, RDFa and ...
Syntactic analysis of search queries is important for a variety of information-retrieval tasks; however, the lack of annotated data makes training query analysis models difficult...
Kuzman Ganchev, Keith Hall, Ryan T. McDonald, Slav...
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...