Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
2
0
2
A long-standing open problem in decision tree optimization is now solved with a surprisingly simple algorithm, achieving a constant-factor approximation guarantee.
Finding a hidden node in a graph just got a whole lot faster: a new algorithm slashes the average search cost with provable approximation guarantees, even with non-uniform query costs.