Results 1 to 10 of about 585,419 (256)

From Query-By-Keyword to Query-By-Example: LinkedIn Talent Search Approach [PDF]

Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017
One key challenge in talent search is to translate complex criteria of a hiring position into a search query, while it is relatively easy for a searcher to list examples of suitable candidates for a given position.
Viet Ha−Thuc, Yan Yan, Xianren Wu, Vijay Dialani, Abhishek Gupta, Shakti Sinha   +5 more
core   +5 more sources

SPARQL Query Recommendations by Example [PDF]

, 2016
In this demo paper, a SPARQL Query Recommendation Tool (called SQUIRE) based on query reformulation is presented. Based on three steps, Generalization, Specialization and Evaluation, SQUIRE implements the logic of reformulating a SPARQL query that is ...
Adamou, Alessandro, Allocca, Carlo, d'Aquin, Mathieu, Motta, Enrico   +3 more
core   +3 more sources

[Invited Paper] Strategies for Searching Video Content with Text Queries or Video Examples [PDF]

, 2016
The large number of user-generated videos uploaded on to the Internet everyday has led to many commercial video search engines, which mainly rely on text metadata for search. However, metadata is often lacking for user-generated videos, thus these videos
Shoou-I Yu, Yi Yang, Zhongwen Xu, Shicheng Xu, Deyu Meng, Zexi Mao, Zhigang Ma, Ming Lin, Xuanchong Li, Huan Li, Zhenzhong Lan, Lu Jiang, Alexander G. Hauptmann, Chuang Gan, Xingzhong Du, Xiaojun Chang   +15 more
openalex   +4 more sources

Query-by-example graafitietokannassa [PDF]

, 2022
Verkkomaisen tiedon käsittely graafitietokannassa on vaihtoehto relaatiotietokannoille. Taulukkomuotoiset tietokannat ovat kehittäjille helppo ymmärtää, mutta graafitietokannat voivat vaatia osaamista graafiteoriasta.
Lay, Chi-Hao
core   +2 more sources

Query by Example: Semantic Traffic Scene Retrieval Using LLM-Based Scene Graph Representation. [PDF]

Sensors (Basel)
Tian Y, Carballo A, Li R, Thompson S, Takeda K.   +4 more
europepmc   +2 more sources

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, Jehoshua Bruck, Rakesh Agrawal, Senior Member, Senior Member   +4 more
core   +3 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, Balodis, Kaspars, Belovs, Aleksandrs, Lee, Troy, Santha, Miklos, Smotrovs, Juris   +5 more
core   +3 more sources

Efficient & Effective Selective Query Rewriting with Efficiency Predictions [PDF]

, 2017
To enhance effectiveness, a user's query can be rewritten internally by the search engine in many ways, for example by applying proximity, or by expanding the query with related terms.
Macdonald, Craig, Ounis, Iadh, Tonellotto, Nicola   +2 more
core   +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, Li, Feifei, Phillips, Jeff M., Tang, Mingwang   +3 more
core   +3 more sources

Issues in the Design of a Pilot Concept-Based Query Interface for the Neuroinformatics Information Framework [PDF]

, 2008
This paper describes a pilot query interface that has been constructed to help us explore a "concept-based" approach for searching the Neuroscience Information Framework (NIF).
Li, Yuli, Marenco, Luis, Martone, Maryann E., Miller, Perry L., Shepherd, Gordon M., Sternberg, Paul W.   +5 more
core   +1 more source