Haim Schweitzer

Affiliations:
  • University of Texas at Dallas, USA


According to our database1, Haim Schweitzer authored at least 64 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Spectral pursuit for simultaneous sparse representation with accuracy guarantees.
Int. J. Data Sci. Anal., May, 2024

The art of centering without centering for robust principal component analysis.
Data Min. Knowl. Discov., 2024

Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Graph Clustering Methods Derived from Column Subset Selection (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Electrophysiological Brain Source Imaging via Combinatorial Search with Provable Optimality.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021
A Fast Algorithm for Simultaneous Sparse Approximation.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2021

Heuristic Search for Approximating One Matrix in Terms of Another Matrix.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

A Lookahead Algorithm for Robust Subspace Recovery.
Proceedings of the IEEE International Conference on Data Mining, 2021

Edge Sparsification for Graphs via Meta-Learning.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

A New Robust Subspace Recovery Algorithm (Student Abstract).
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-Optimality.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Fast Distance Metrics in Low-dimensional Space for Neighbor Search Problems.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

A Bias Trick for Centered Robust Principal Component Analysis (Student Abstract).
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A Bias Trick for Centered Robust Principal Component Analysis.
CoRR, 2019

Improving the Accuracy of Principal Component Analysis by the Maximum Entropy Method.
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

Heuristic Search Algorithm for Dimensionality Reduction Optimally Combining Feature Selection and Feature Extraction.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Two-Stage Feature Selection with Unsupervised Second Stage.
Int. J. Artif. Intell. Tools, 2018

Computing Robust Principal Components by A* Search.
Int. J. Artif. Intell. Tools, 2018

Solving Generalized Column Subset Selection With Heuristic Search.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Enhancing the Privacy of Predictors.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Cleaning the Null Space: A Privacy Mechanism for Predictors.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Weighted A* Algorithms for Unsupervised Feature Selection with Provable Bounds on Suboptimality.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Improved Greedy Algorithms for Sparse Approximation of a Matrix in Terms of Another Matrix.
IEEE Trans. Knowl. Data Eng., 2015

Optimal Column Subset Selection by A-Star Search.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013
Pass-efficient unsupervised feature selection.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2011
A Dual-Bound Algorithm for Very Fast and Exact Template Matching.
IEEE Trans. Pattern Anal. Mach. Intell., 2011

2009
Fixed Time Template Matching.
Proceedings of the IEEE International Conference on Systems, 2009

A near optimal acceptance-rejection algorithm for exact cross-correlation search.
Proceedings of the IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27, 2009

2005
Feature Selection for Learning from Images.
Proceedings of The 2005 International Conference on Computer Vision, 2005

Fast Selection of Linear Features in Image Data.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2005

2004
Long-term learning of semantic grouping from relevance-feedback.
Proceedings of the 6th ACM SIGMM International Workshop on Multimedia Information Retrieval, 2004

2002
Very Fast Template Matching.
Proceedings of the Computer Vision, 2002

Computing Content-Plots for Video.
Proceedings of the Computer Vision, 2002

2001
Template Matching Approach to Content Based Image Indexing by Low Dimensional Euclidean Embedding.
Proceedings of the Eighth International Conference On Computer Vision (ICCV-01), Vancouver, British Columbia, Canada, July 7-14, 2001, 2001

1999
Precise induction from statistical data.
J. Exp. Theor. Artif. Intell., 1999

Organizing image databases as visual-content search trees.
Image Vis. Comput., 1999

Utilizing Scatter for Pixel Subspace Selection.
Proceedings of the International Conference on Computer Vision, 1999

Optimal Eigenfeature Selection by Optimal Image Registration.
Proceedings of the 1999 Conference on Computer Vision and Pattern Recognition (CVPR '99), 1999

1998
Computational limitations of model-based recognition.
Int. J. Intell. Syst., 1998

Utilizing Moment Invariants and Grobner Bases to Reason about Shapes.
Comput. Intell., 1998

Indexing Images by Trees of Visual Content.
Proceedings of the Sixth International Conference on Computer Vision (ICCV-98), 1998

Computing Ritz Approximations of Primary Images.
Proceedings of the Sixth International Conference on Computer Vision (ICCV-98), 1998

1997
A Distributed Algorithm for Content Based Indexing of Images by Projections on Ritz Primary Images.
Data Min. Knowl. Discov., 1997

Classification and Reductio-ad-Absurdum Optimality Proofs.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Structure from Multiple 2D Affine Correspondences without Camera Calibration.
Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96), 1996

1995
Occam Algorithms for Computing Visual Motion.
IEEE Trans. Pattern Anal. Mach. Intell., 1995

1993
A surface matching algorithm for two perspective views.
Proceedings of the Conference on Computer Vision and Pattern Recognition, 1993

1991
A Probabilistic Algorithm for Computing Hough Transforms.
J. Algorithms, 1991

1990
Learnable and Nonlearnable Visual Concepts.
IEEE Trans. Pattern Anal. Mach. Intell., 1990

Surface Orientation from Projective Foreshortening of Isotropic Texture Autocorrelation.
IEEE Trans. Pattern Anal. Mach. Intell., 1990

A Necessary Condition for Learning from Positive Examples.
Mach. Learn., 1990

Towards a computational theory of model based vision and perception.
Proceedings of the Third International Conference on Computer Vision, 1990

Probabilities that Imply Certainties.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1988
Representing Knowledge in Learning Systems by Pseudo Boolean Functions.
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

Learnable And Non-learnable Visual Concepts.
Proceedings of the Second International Conference on Computer Vision, 1988

Detecting motion in out-of-register pictures.
Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1988

Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987
Representation of patterns of symbols by equations with applications to puzzle solving.
Pattern Recognit. Lett., 1987

Inversion of picture operators.
Pattern Recognit. Lett., 1987

1986
Mathematical models in image processing and pattern recognition (מודלים מתמטיים בעבוד תמונות וזהוי צורות.).
PhD thesis, 1986

1985
Noisy image restoration by cost function minimization.
Pattern Recognit. Lett., 1985

Fuzzy and probability vectors as elements of a vector space.
Inf. Sci., 1985


  Loading...