We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
We present a method for real-time 3D object detection
that does not require a time consuming training stage, and
can handle untextured objects. At its core, is a novel tem-
plat...
Stefan Hinterstoisser, Vincent Lepetit, Slobodan I...
—This paper proposes the sequential context inference (SCI) algorithm for Markov random field (MRF) image analysis. This algorithm is designed primarily for fast inference on an...
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...