Paul Fischer

Orcid: 0000-0003-3296-5301

According to our database1, Paul Fischer authored at least 46 papers between 1986 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A time-relaxation reduced order model for the turbulent channel flow.
J. Comput. Phys., 2025

2024
Conformal Performance Range Prediction for Segmentation Output Quality Control.
Proceedings of the Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, 2024

PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2024, 2024

Subgroup-Specific Risk-Controlled Dose Estimation in Radiotherapy.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2024, 2024

A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

2023
Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows.
CoRR, 2023

Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction.
Proceedings of the Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, 2023

First Steps Towards a Runtime Analysis of Neuroevolution.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

2019
High-K Gate Dielectric GaN MOS-HEMTs with Regrown n+ InGaN Source/Drain (Invited Paper).
Proceedings of the Device Research Conference, 2019

2017
Detecting structural breaks in time series via genetic algorithms.
Soft Comput., 2017

2014
Load Scheduling in a Cloud Based Massive Video-Storage Environment.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

2013
Evolutionary algorithms for the detection of structural breaks in time series: extended abstract.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

How to reduce power in 3D IC designs: A case study with OpenSPARC T2 core.
Proceedings of the IEEE 2013 Custom Integrated Circuits Conference, 2013

2011
Edge-Matching Problems with Rotations.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2008
Faults Analysis in Distributed Systems - Quantitative Estimation of Reliability and Resource Requirements.
Proceedings of the ICSOFT 2008, 2008

2004
The complexity of computing the MCD-estimator.
Theor. Comput. Sci., 2004

Predicting Protein Secondary Structure with Markov Models.
Proceedings of the Classification, 2004

2002
Foreword.
Theor. Comput. Sci., 2002

Finite-time Analysis of the Multiarmed Bandit Problem.
Mach. Learn., 2002

Exploiting Random Walks for Learning.
Inf. Comput., 2002

Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications.
Comput. Stat., 2002

Classification Based on the Support Vector Machine, Regression Depth, and Discriminant Analysis.
Proceedings of the COMPSTAT 2002, 2002

2001
A Lower Bound for Families of Natarajan Dimension d.
J. Comb. Theory A, 2001

1999
Applications of the balanced method to stochastic differential equations in filtering.
Monte Carlo Methods Appl., 1999

Sample-Efficient Strategies for Learning in the Presence of Noise.
J. ACM, 1999

On the Cut-off Point for Combinatorial Group Testing.
Discret. Appl. Math., 1999

Algorithmisches Lernen.
Leitfäden der Informatik, Teubner, ISBN: 978-3-519-02946-5, 1999

1998
Finite-Time Regret Bounds for the Multiarmed Bandit Problem.
Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

1997
PAC-Learning from General Examples.
Theor. Comput. Sci., 1997

On the Optimal Number of Subdomains for Hyperbolic Problems on Parallel Computers.
Int. J. High Perform. Comput. Appl., 1997

Mapping Urban Air Pollution Using GIS: A Regression-Based Approach.
Int. J. Geogr. Inf. Sci., 1997

Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon.
Comput. Geom., 1997

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996
Probably Almost Bayes Decisions.
Inf. Comput., 1996

Trial and Error. A New Approach to Space-Bounded Learning.
Acta Informatica, 1996

Noise-Tolerant Learning Near the Information-Theoretic Bound.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
More or Less Efficient Agnostic Learning of Convex Polygons.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994
Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon.
Inf. Process. Lett., 1994

1993
Approximations with Axis-Aligned Rectangles (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Finding Maximum Convex Polygons.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Learning unions of convex polygons.
Proceedings of the First European Conference on Computational Learning Theory, 1993

1992
On Learning Ring-Sum-Expansions.
SIAM J. Comput., 1992

PAB-Decisions for Boolean and Real-Valued Features.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
Probably Almost Bayes Decisions.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990
Separation Problems and Circular Arc Systems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1986
Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees.
J. Symb. Log., 1986


  Loading...