Search Results for author:
Found 2 papers, 1 papers with code
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
We therefore propose the novel notion of an any-k ranking algorithm: for a given time budget, re- turn as many of the top-ranked results as possible.
Social and Information Networks Databases Data Structures and Algorithms
Distributed Entity Disambiguation with Per-Mention Learning
Entity disambiguation, or mapping a phrase to its canonical representation in a knowledge base, is a fundamental step in many natural language processing applications.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
