Probabilistic Latent Semantic Analysis (PLSA) has become a popular topic model for image clustering. However, the traditional PLSA method considers each image (document) independen...
The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating...
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev