57 citations · 85 across the 4 of their papers we have counts for
4 papers
Conditional Probability Tree Estimation Analysis and Algorithms
Alina Beygelzimer, John Langford, Yuri Lifshits +2
We consider the problem of estimating the conditional probability of a label in time O(log n), where n is the number of possible labels. We analyze a natural reduction of this prob…
Maximal Intersection Queries in Randomized Input Models
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits +1
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constrai…
Conditional Probability Tree Estimation Analysis and Algorithms
Alina Beygelzimer, John Langford, Yuri Lifshits +2
We consider the problem of estimating the conditional probability of a label in time , where is the number of possible labels. We analyze a natural reduction of this…
Solving Classical String Problems on Compressed Texts
Yury Lifshits
Here we study the complexity of string problems as a function of the size of a program that generates input. We consider straight-line programs (SLP), since all algorithms on SLP-g…