Search Results for author:
Found 2 papers, 1 papers with code
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
Given a set of uncertain elements and a family of $m$ subsets of that set, we present an algorithm for determining the value of the minimum of each of the subsets that requires at most $(2+\varepsilon) \cdot \mathrm{opt}_k+\mathrm{O}\left(\frac{1}{\varepsilon} \cdot \lg m\right)$ rounds for every $0<\varepsilon<1$, where $\mathrm{opt}_k$ is the optimal number of rounds, as well as nearly matching lower bounds.
Data Structures and Algorithms
Using Multi-Label Classification for Improved Question Answering
In particular, we develop a multi-label classification-based metasystem for question answering over 6 existing systems using an innovative set of 14 question features.
