7 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.DS2013★ 7 cited
Tree-Independent Dual-Tree Algorithms
Ryan R. Curtin, William B. March, Parikshit Ram +3
Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often compl…
cs.AI2012★ 4 cited
Unsupervised Activity Discovery and Characterization From Event-Streams
Rafay Hammid, Siddhartha Maddi, Amos Johnson +3
We present a framework to discover and characterize different classes of everyday activities from event-streams. We begin by representing activities as bags of event n-grams. This…