The art of centering without centering for robust principal component analysis   DMKD. 2023.
 Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub- Optimality.   AAAI'21.
 Heuristic Search Algorithm for Dimensionality Reduction Optimally Combining Feature Selection and Feature Extraction.   AAAI'19.
 Two-Stage Feature Selection with Unsupervised Second Stage.   IJAIT. 27(7), 2018.
 Cleaning the null space: A privacy mechanism for predictors.   AAAI'17.
 Unsupervised feature selection by heuristic search with provable bounds on suboptimality.   AAAI'16.
 Improved greedy algorithms for sparse approximation of a matrix in terms of another matrix.   IEEE TKDE. 27(3):769--780, 2015.
 Optimal column subset selection by A-Star search.   AAAI'15.
 Pass-efficient unsupervised feature selection.   NIPS'13.
 A dual bound algorithm for very fast and exact template-matching.   IEEE TPAMI. 33(3):459--470, 2011.
 Occam algorithms for computing visual motion.   IEEE TPAMI. 17(11):1033--1042, 1995.
 A probabilistic algorithm for computing Hough transforms.   Journal of Algorithms. 12(4):639--656, 1991.
 Learnable and nonlearnable visual concepts.   IEEE TPAMI. 12(5):459--466, May 1990.
 Surface orientation from projective foreshortening of isotropic texture autocorrelation.   IEEE TPAMI. 12(6):584--588, 1990.
 A necessary condition for learning from positive examples.   Machine Learning 5(1):101--103, 1990.