Alexander Wolpert

CoRR, 2024

OSSA: Unsupervised One-Shot Style Adaptation.

[BibT_eX]

[DOI]

CoRR, 2024

Utilizing Grounded SAM for self-supervised frugal camouflaged human detection.

[BibT_eX]

[DOI]

CoRR, 2024

2023

An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2023

An AlphaZero-Inspired Approach to Solving Search Problems.

[BibT_eX]

[DOI]

Proceedings of the Decision Making Under Uncertainty and Constraints - A Why-Book, 2023

2022

An AlphaZero-Inspired Approach to Solving Search Problems.

[BibT_eX]

[DOI]

CoRR, 2022

2020

Similarity Between Points in Metric Measure Spaces.

[BibT_eX]

[DOI]

Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

Anchor-free Small-scale Multispectral Pedestrian Detection.

[BibT_eX]

[DOI]

Proceedings of the 31st British Machine Vision Conference 2020, 2020

2018

Reconstruction of Boolean Formulas in Conjunctive Normal Form.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Lifetact: utilizing smartwatches as tactile heartbeat displays in video games.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Mobile and Ubiquitous Multimedia, 2017

2013

Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2010

On Moderately Exponential Time for SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2006

Population Variance under Interval Uncertainty: A New Algorithm.

[BibT_eX]

[DOI]

Reliab. Comput., 2006

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2006

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s<sup>2</sup>) Time.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems.

[BibT_eX]

[DOI]

Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005

On quantum versions of record-breaking algorithms for SAT.

[BibT_eX]

[DOI]

SIGACT News, 2005

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms

[BibT_eX]

[DOI]

Edward A. Hirsch

Electron. Colloquium Comput. Complex., 2005

An Improved Upper Bound for SAT

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

2004

Derandomization of Schuler's Algorithm for SAT

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

2003

A Robust Dna Computation Model That Captures Pspace.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Algorithms for SAT based on search in Hamming balls

[BibT_eX]

[DOI]

Edward A. Hirsch

Electron. Colloquium Comput. Complex., 2003

2002

Solving Constraint Satisfaction Problems with DNA Computing.

[BibT_eX]

[DOI]