Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
Objects in the world can be arranged into a hierarchy based on their semantic meaning (e.g. organism ? animal ? feline ? cat). What about defining a hierarchy based on the visual ...
Josef Sivic, Bryan C. Russell, Andrew Zisserman, W...
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
We study the problem of classifying an autistic group from controls using structural image data alone, a task that requires a clinical interview with a psychologist. Because of the...