Search Results for author:
Found 5 papers, 0 papers with code
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons
We present a simple $O(n^4)$-time algorithm for computing optimal search trees with two-way comparisons.
Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45 E.4; G.1.6; G.2.2; H.3.1; I.4.2
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons
We address the question "what is the additional cost of determining approximate locations for non-key queries"?
Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45 E.4; G.1.6; G.2.2; H.3.1; I.4.2
Distributed algorithms for covering, packing and maximum weighted matching
The approximation ratio D is the maximum number of variables in any constraint.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing 90C26, 68W15 C.2.4; G.1.6
Exploiting Transitivity for Learning Person Re-Identification Models on a Budget
Minimization of labeling effort for person re-identification in camera networks is an important problem as most of the existing popular methods are supervised and they require large amount of manual annotations, acquiring which is a tedious job.
Optimal Search Trees with 2-Way Comparisons
Until this paper, the problem of finding an optimal search tree using 2-way comparisons remained open -- poly-time algorithms were known only for restricted variants.
Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45, E.4; G.1.6; G.2.2; H.3.1; I.4.2
