57 results on '"Paul Fischer"'
Search Results
2. PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration.
3. Conformal Performance Range Prediction for Segmentation Output Quality Control.
4. A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation.
5. A time-relaxation reduced order model for the turbulent channel flow.
6. PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration.
7. Subgroup-Specific Risk-Controlled Dose Estimation in Radiotherapy.
8. Conformal Performance Range Prediction for Segmentation Output Quality Control.
9. First Steps Towards a Runtime Analysis of Neuroevolution.
10. Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction.
11. A Time-Relaxation Reduced Order Model for the Turbulent Channel Flow.
12. Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction.
13. First Steps towards a Runtime Analysis of Neuroevolution.
14. Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows.
15. High-K Gate Dielectric GaN MOS-HEMTs with Regrown n+ InGaN Source/Drain (Invited Paper).
16. Detecting structural breaks in time series via genetic algorithms.
17. Load Scheduling in a Cloud Based Massive Video-Storage Environment.
18. How to reduce power in 3D IC designs: A case study with OpenSPARC T2 core.
19. Edge-Matching Problems with Rotations.
20. Edge-matching Problems with Rotations.
21. Faults Analysis in Distributed Systems - Quantitative Estimation of Reliability and Resource Requirements.
22. Predicting Protein Secondary Structure with Markov Models.
23. Classification Based on the Support Vector Machine, Regression Depth, and Discriminant Analysis.
24. Does finger sense really have a delayed effect on children's addition performance?
25. Finite-Time Regret Bounds for the Multiarmed Bandit Problem.
26. Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
27. Noise-Tolerant Learning Near the Information-Theoretic Bound.
28. More or Less Efficient Agnostic Learning of Convex Polygons.
29. Exploiting Random Walks for Learning.
30. The complexity of computing the MCD-estimator.
31. Learning unions of convex polygons.
32. Trial and error: a new approach to space-bounded learning.
33. Approximations with Axis-Aligned Rectangles (Extended Abstract).
34. Finding Maximum Convex Polygons.
35. PAB-Decisions for Boolean and Real-Valued Features.
36. Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications.
37. Exploiting Random Walks for Learning.
38. Finite-time Analysis of the Multiarmed Bandit Problem.
39. Probably Almost Bayes Decisions.
40. A Lower Bound for Families of Natarajan Dimension d.
41. On Learning Ring-Sum-Expansions.
42. Separation Problems and Circular Arc Systems.
43. Applications of the balanced method to stochastic differential equations in filtering.
44. On the Cut-off Point for Combinatorial Group Testing.
45. Sample-Efficient Strategies for Learning in the Presence of Noise.
46. Evolutionary algorithms for the detection of structural breaks in time series: extended abstract.
47. On the Optimal Number of Subdomains for Hyperbolic Problems on Parallel Computers.
48. Mapping Urban Air Pollution Using GIS: A Regression-Based Approach.
49. PAC-Learning from General Examples.
50. Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.