Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Artificial Intelligence and Image Analysis : 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8-10, 2024, Revised Selected Papers
| Artificial Intelligence and Image Analysis : 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8-10, 2024, Revised Selected Papers |
| Autore | Barneva Reneta P |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer, , 2024 |
| Descrizione fisica | 1 online resource (269 pages) |
| Altri autori (Persone) |
BrimkovValentin E
GentileClaudio PacchianoAldo |
| Collana | Lecture Notes in Computer Science Series |
| ISBN | 9783031637353 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Foreword -- Preface -- Organization -- Contents -- A Model for Optimizing Recalculation Schedules to Minimize Regret -- 1 Introduction -- 2 Warm up -- 3 Uniform Recalculations -- 4 Constant Number of Recalculations -- 5 Schedules with Increasing Recalculations in T -- References -- A Theory of Learning with Competing Objectives and User Feedback -- 1 Introduction -- 2 Conflict Resolution Model -- 3 Stochastic Setting -- 4 Experiments -- 5 Conclusion -- A Related Work -- B Stochastic Setting -- B.1 Case m = 2 -- B.2 General cCse -- C Beyond T23 Regret -- D Adversarial Setting -- E Experiments -- E.1 Experiments with Simulated Data -- E.2 Experiments with a Real-World Dataset -- F Further Discussion on the COMPAS Example -- References -- Trick Costs for and New Relatives -- 1 Introduction -- 2 Preliminaries -- 3 Minimax Truncated with Random Playouts -- 4 Template Algorithm -- 5 Imperfect Information Tree Search -- 5.1 Fusion Algorithm -- 6 Implementation -- 7 Experiments -- 8 Conclusion -- References -- A Differential Approach for Several NP-hard Optimization Problems -- 1 Introduction -- 2 Statement of Problems -- 3 Related Work -- 4 MAXCUT -- 5 MAXkSAT -- 6 MAXNAE2SAT -- 7 Conclusion -- References -- On the Computational Complexities of Finding Selected Refutations of Linear Programs -- 1 Introduction -- 2 Statement of Problems -- 2.1 Complexity Classes -- 2.2 Minimum 0-1 Integer Programming -- 3 Motivation and Related Work -- 4 Read-Once Refutations -- 5 Tree-Like Refutations -- 6 Dag-Like Refutations -- 7 Conclusion -- References -- Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth -- 1 Introduction -- 2 Preliminaries -- 3 A Generalization of Treewidth by Defining New Graph Classes -- 4 Recognition of Graphs of a Given Class CkW -- 5 Class CkW and Tractability of the Maximum Clique Problem.
6 Classes CkW and Graphs of Unbounded Treewidth -- 7 Discussion and Conclusion -- References -- Principled Approaches for Learning to Defer with Multiple Experts -- 1 Introduction -- 2 Preliminaries -- 3 General Surrogate Losses -- 4 H-Consistency Bounds for Surrogate Losses -- 5 Benefits of Minimizability Gaps -- 6 Learning Bounds -- 7 Experiments -- 8 Conclusion -- A Related Work -- B Experimental Details -- C Proof of H-Consistency Bounds for Deferral Surrogate Losses -- C.1 Conditional Regret of the Deferral Loss -- C.2 Conditional Regret of a Surrogate Deferral Loss -- C.3 Conditional Regret of Zero-One Loss -- C.4 Proof of H-Consistency Bounds for Deferral Surrogate Losses (Theorem 1) -- D Examples of Deferral Surrogate Losses and Their H-Consistency Bounds -- D.1 Being Adopted as Comp-Sum Losses -- D.2 Being Adopted as Sum Losses -- D.3 Being Adopted as Constrained Losses -- E Proof of Learning Bounds for Deferral Surrogate Losses (Theorem 2) -- References -- On Sample Reuse Methods for Answering k-wise Statistical Queries -- 1 Introduction -- 2 Preliminaries -- 3 Baseline Simulation of an SQ Oracle -- 4 Independent Pseudo-Samples for Adaptive Queries -- 4.1 Privacy Composition -- 4.2 Laplace Mechanism -- 5 Dependent k-wise Samples for Non-adaptive Queries -- References -- Neural Diffusion Graph Convolutional Network for Predicting Heat Transfer in Selective Laser Melting -- 1 Introduction -- 2 Related Work -- 2.1 Numerical Analysis and PINNs -- 2.2 Differential Equation Inspired Neural Networks -- 2.3 Neural Diffusion Graph Networks -- 3 Methodology and Benchmarking -- 3.1 Methodology NDGCN -- 3.2 Benchmark -- 4 Data Integration -- 4.1 Graph Construction from Thermal Images -- 4.2 Modelling Internal Heat Using Graph Diffusion -- 4.3 Results -- 5 Conclusion and Discussion -- References. New Proportion Measures of Discrimination Based on Natural Direct and Indirect Effects -- 1 Introduction -- 2 Structural Causal Model -- 3 Effect Measures -- 4 Discrimination Criteria -- 5 Proportion Measures of Discrimination -- 6 Application -- 7 Conclusion -- References -- Addressing Discretization Artifacts in Tomography by Accessing and Balancing Pixel Coverage of Projections -- 1 Introduction and Related Work -- 2 Mathematical Background and Projection Matrix -- 2.1 Interpolation During the Projection Matrix Calculation -- 2.2 Pixel Coverage and Our Proposed Correction Step -- 3 Experimental Setup -- 3.1 Reconstruction Algorithms -- 3.2 Geometry -- 3.3 Test Images -- 3.4 Random Noise on Projections -- 3.5 Metrics -- 4 Results and Discussion -- 4.1 Reconstruction Algorithm and Noise -- 4.2 Geometries -- 5 Conclusion -- References -- Finding the Straight Skeleton for 3D Orthogonal Polyhedrons: A Combinatorial Approach -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 Combinatorial Rules to Derive Straight Skeleton -- 4 Algorithm for Determining Straight Skeleton -- 5 Experimental Results -- 6 Conclusion -- References -- Towards a Unifying View on Monotone Constructive Definitions -- 1 Introduction -- 2 Algebraic Formalisation -- 3 Different Flavours of Constructive Definitions -- 3.1 (Co)inductive Definitions of Sets -- 3.2 (Co)recursive Definitions of Functions -- 3.3 Definitions with Custom-Designed Cpo's -- 4 Conclusion and Future Work -- References -- Partial Boolean Functions for QBF Semantics -- 1 Introduction -- 2 Basic Definitions and Notation -- 2.1 Boolean If-Then-Else -- 3 Partial Boolean Functions -- 4 Syntax of LDP-Resolution -- 5 Partial Herbrand Functions -- 6 Logical Implications in QBF Derivations -- 7 Conclusion -- A Logical Operators on Pbfs -- B Derivations That Are Not Logical Consequences -- References. Author Index. |
| Record Nr. | UNINA-9910874693603321 |
Barneva Reneta P
|
||
| Cham : , : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors
| Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XIII, 413 p. 97 illus., 38 illus. in color.) |
| Disciplina | 519.3 |
| Collana | AIRO Springer Series |
| Soggetto topico |
Combinatorial optimization
Optimització combinatòria |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-63072-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph -- J. Dìaz et al., On List k-Coloring Convex Bipartite Graphs -- E. Kubicka et al., Total chromatic sum for trees -- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph -- S. Bandopadhyay et al., Improved Bounds on the Span of L(1,2)-edge Labeling of Some Infinite Regular Grids -- E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm -- H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths -- L. Liberti et al., A cycle-based formulation for the Distance Geometry Problem -- P. Samer and D. Haugland, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope -- Lucas L. S. Portugal et al., Relating hypergraph parameters of generalized power graphs -- A. Nixon, Assur decompositions of direction-length frameworks -- M. Hiller et al., On the Burning Number of p-Caterpillars -- J. Boeckmann and C. Thielen, An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities -- T. Bacci and S. Nicoloso, On the benchmark instances for the Bin Packing Problem with Conflicts -- Barbara M. Anthony and Alison M. Marr, Directed Zagreb Indices -- F. Couto et al., Edge Tree Spanners -- S. Khalife, Sequence graphs: characterization and counting of admissible elements -- L. Burahem Martins et al., On solving the time window assignment vehicle routing problem via iterated local search -- M. Barbato et al., Synchronized Pickup and Delivery Problems with Connecting FIFO Stack -- A. Teymourifar et al., A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem -- M. Bodirsky et al., Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables -- M. Cacciola et al., A Lagrangian approach to Chance Constrained Routing with Local Broadcast -- P. Detti et al., A metaheuristic approach for biological sample transportation in healthcare -- Diego M. Pinto and G. Stecca, Optimal Planning of Waste Sorting Operations through Mixed Integer Linear Programming -- G. Micheli et al., Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables -- T. Bacci et al., Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints -- J. Lee et al., Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions -- M. Aprile et al., Recognizing Cartesian products of matrices and polytopes -- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time -- R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling -- F. Mendoza-Granada and M. Villagra, A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering. |
| Record Nr. | UNISA-996466551003316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors
| Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XIII, 413 p. 97 illus., 38 illus. in color.) |
| Disciplina | 519.3 |
| Collana | AIRO Springer Series |
| Soggetto topico |
Combinatorial optimization
Optimització combinatòria |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-63072-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph -- J. Dìaz et al., On List k-Coloring Convex Bipartite Graphs -- E. Kubicka et al., Total chromatic sum for trees -- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph -- S. Bandopadhyay et al., Improved Bounds on the Span of L(1,2)-edge Labeling of Some Infinite Regular Grids -- E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm -- H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths -- L. Liberti et al., A cycle-based formulation for the Distance Geometry Problem -- P. Samer and D. Haugland, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope -- Lucas L. S. Portugal et al., Relating hypergraph parameters of generalized power graphs -- A. Nixon, Assur decompositions of direction-length frameworks -- M. Hiller et al., On the Burning Number of p-Caterpillars -- J. Boeckmann and C. Thielen, An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities -- T. Bacci and S. Nicoloso, On the benchmark instances for the Bin Packing Problem with Conflicts -- Barbara M. Anthony and Alison M. Marr, Directed Zagreb Indices -- F. Couto et al., Edge Tree Spanners -- S. Khalife, Sequence graphs: characterization and counting of admissible elements -- L. Burahem Martins et al., On solving the time window assignment vehicle routing problem via iterated local search -- M. Barbato et al., Synchronized Pickup and Delivery Problems with Connecting FIFO Stack -- A. Teymourifar et al., A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem -- M. Bodirsky et al., Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables -- M. Cacciola et al., A Lagrangian approach to Chance Constrained Routing with Local Broadcast -- P. Detti et al., A metaheuristic approach for biological sample transportation in healthcare -- Diego M. Pinto and G. Stecca, Optimal Planning of Waste Sorting Operations through Mixed Integer Linear Programming -- G. Micheli et al., Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables -- T. Bacci et al., Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints -- J. Lee et al., Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions -- M. Aprile et al., Recognizing Cartesian products of matrices and polytopes -- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time -- R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling -- F. Mendoza-Granada and M. Villagra, A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering. |
| Record Nr. | UNINA-9910482970703321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Learning theory : 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007 : proceedings / / Nader H. Bshouty, Claudio Gentile (editors)
| Learning theory : 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007 : proceedings / / Nader H. Bshouty, Claudio Gentile (editors) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (644 p.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico | Machine learning |
| ISBN |
1-280-94078-6
9786610940783 3-540-72927-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Property Testing: A Learning Theory Perspective -- Spectral Algorithms for Learning and Clustering -- Unsupervised, Semisupervised and Active Learning I -- Minimax Bounds for Active Learning -- Stability of k-Means Clustering -- Margin Based Active Learning -- Unsupervised, Semisupervised and Active Learning II -- Learning Large-Alphabet and Analog Circuits with Value Injection Queries -- Teaching Dimension and the Complexity of Active Learning -- Multi-view Regression Via Canonical Correlation Analysis -- Statistical Learning Theory -- Aggregation by Exponential Weighting and Sharp Oracle Inequalities -- Occam’s Hammer -- Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector -- Suboptimality of Penalized Empirical Risk Minimization in Classification -- Transductive Rademacher Complexity and Its Applications -- Inductive Inference -- U-Shaped, Iterative, and Iterative-with-Counter Learning -- Mind Change Optimal Learning of Bayes Net Structure -- Learning Correction Grammars -- Mitotic Classes -- Online and Reinforcement Learning I -- Regret to the Best vs. Regret to the Average -- Strategies for Prediction Under Imperfect Monitoring -- Bounded Parameter Markov Decision Processes with Average Reward Criterion -- Online and Reinforcement Learning II -- On-Line Estimation with the Multivariate Gaussian Distribution -- Generalised Entropy and Asymptotic Complexities of Languages -- Q-Learning with Linear Function Approximation -- Regularized Learning, Kernel Methods, SVM -- How Good Is a Kernel When Used as a Similarity Measure? -- Gaps in Support Vector Optimization -- Learning Languages with Rational Kernels -- Generalized SMO-Style Decomposition Algorithms -- Learning Algorithms and Limitations on Learning -- Learning Nested Halfspaces and Uphill Decision Trees -- An Efficient Re-scaled Perceptron Algorithm for Conic Systems -- A Lower Bound for Agnostically Learning Disjunctions -- Sketching Information Divergences -- Competing with Stationary Prediction Strategies -- Online and Reinforcement Learning III -- Improved Rates for the Stochastic Continuum-Armed Bandit Problem -- Learning Permutations with Exponential Weights -- Online and Reinforcement Learning IV -- Multitask Learning with Expert Advice -- Online Learning with Prior Knowledge -- Dimensionality Reduction -- Nonlinear Estimators and Tail Bounds for Dimension Reduction in l 1 Using Cauchy Random Projections -- Sparse Density Estimation with ?1 Penalties -- ?1 Regularization in Infinite Dimensional Feature Spaces -- Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking -- Other Approaches -- Observational Learning in Random Networks -- The Loss Rank Principle for Model Selection -- Robust Reductions from Ranking to Classification -- Open Problems -- Rademacher Margin Complexity -- Open Problems in Efficient Semi-supervised PAC Learning -- Resource-Bounded Information Gathering for Correlation Clustering -- Are There Local Maxima in the Infinite-Sample Likelihood of Gaussian Mixture Estimation? -- When Is There a Free Matrix Lunch?. |
| Record Nr. | UNISA-996465400203316 |
| Berlin, Germany : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Learning theory : 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007 : proceedings / / Nader H. Bshouty, Claudio Gentile (editors)
| Learning theory : 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007 : proceedings / / Nader H. Bshouty, Claudio Gentile (editors) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (644 p.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico | Machine learning |
| ISBN |
1-280-94078-6
9786610940783 3-540-72927-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Property Testing: A Learning Theory Perspective -- Spectral Algorithms for Learning and Clustering -- Unsupervised, Semisupervised and Active Learning I -- Minimax Bounds for Active Learning -- Stability of k-Means Clustering -- Margin Based Active Learning -- Unsupervised, Semisupervised and Active Learning II -- Learning Large-Alphabet and Analog Circuits with Value Injection Queries -- Teaching Dimension and the Complexity of Active Learning -- Multi-view Regression Via Canonical Correlation Analysis -- Statistical Learning Theory -- Aggregation by Exponential Weighting and Sharp Oracle Inequalities -- Occam’s Hammer -- Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector -- Suboptimality of Penalized Empirical Risk Minimization in Classification -- Transductive Rademacher Complexity and Its Applications -- Inductive Inference -- U-Shaped, Iterative, and Iterative-with-Counter Learning -- Mind Change Optimal Learning of Bayes Net Structure -- Learning Correction Grammars -- Mitotic Classes -- Online and Reinforcement Learning I -- Regret to the Best vs. Regret to the Average -- Strategies for Prediction Under Imperfect Monitoring -- Bounded Parameter Markov Decision Processes with Average Reward Criterion -- Online and Reinforcement Learning II -- On-Line Estimation with the Multivariate Gaussian Distribution -- Generalised Entropy and Asymptotic Complexities of Languages -- Q-Learning with Linear Function Approximation -- Regularized Learning, Kernel Methods, SVM -- How Good Is a Kernel When Used as a Similarity Measure? -- Gaps in Support Vector Optimization -- Learning Languages with Rational Kernels -- Generalized SMO-Style Decomposition Algorithms -- Learning Algorithms and Limitations on Learning -- Learning Nested Halfspaces and Uphill Decision Trees -- An Efficient Re-scaled Perceptron Algorithm for Conic Systems -- A Lower Bound for Agnostically Learning Disjunctions -- Sketching Information Divergences -- Competing with Stationary Prediction Strategies -- Online and Reinforcement Learning III -- Improved Rates for the Stochastic Continuum-Armed Bandit Problem -- Learning Permutations with Exponential Weights -- Online and Reinforcement Learning IV -- Multitask Learning with Expert Advice -- Online Learning with Prior Knowledge -- Dimensionality Reduction -- Nonlinear Estimators and Tail Bounds for Dimension Reduction in l 1 Using Cauchy Random Projections -- Sparse Density Estimation with ?1 Penalties -- ?1 Regularization in Infinite Dimensional Feature Spaces -- Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking -- Other Approaches -- Observational Learning in Random Networks -- The Loss Rank Principle for Model Selection -- Robust Reductions from Ranking to Classification -- Open Problems -- Rademacher Margin Complexity -- Open Problems in Efficient Semi-supervised PAC Learning -- Resource-Bounded Information Gathering for Correlation Clustering -- Are There Local Maxima in the Infinite-Sample Likelihood of Gaussian Mixture Estimation? -- When Is There a Free Matrix Lunch?. |
| Record Nr. | UNINA-9910767552603321 |
| Berlin, Germany : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||