UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Efficient Regression in Metric Spaces via Approximate Lipschitz Extension

IEEE transactions on information theory, 2017-08, Vol.63 (8), p.4838-4849

2017

Volltextzugriff (PDF)

Near-Optimal Sample Compression for Nearest Neighbors

IEEE transactions on information theory, 2018-06, Vol.64 (6), p.4120-4128

2018

Volltextzugriff (PDF)

Learning Convex Polyhedra With Margin

IEEE transactions on information theory, 2022-03, Vol.68 (3), p.1976-1984

2022

Volltextzugriff (PDF)

Non-uniform packings

Information processing letters, 2022-03, Vol.174, p.106179, Article 106179

2022

Volltextzugriff (PDF)

Using Support Vector Machine (SVM) and Ionospheric Total Electron Content (TEC) Data for Solar Flare Predictions

IEEE journal of selected topics in applied earth observations and remote sensing, 2021, Vol.14, p.1469-1481

2021

Volltextzugriff (PDF)

Predicting Eastern Mediterranean Flash Floods Using Support Vector Machines with Precipitable Water Vapor, Pressure, and Lightning Data

Remote sensing (Basel, Switzerland), 2023-06, Vol.15 (11), p.2916

2023

Volltextzugriff (PDF)

Matrix Sparsification and the Sparse Null Space Problem

Algorithmica, 2016-10, Vol.76 (2), p.426-444

2016

Volltextzugriff (PDF)

Faster algorithms for orienteering and k-TSP

Theoretical computer science, 2022-05, Vol.914, p.73-83

2022

Volltextzugriff (PDF)

Adaptive metric dimensionality reduction

Theoretical computer science, 2016-03, Vol.620, p.105-118

2016

Volltextzugriff (PDF)

Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances

Discrete & computational geometry, 2024-04, Vol.71 (3), p.849-871

2024

Volltextzugriff (PDF)

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

SIAM journal on computing, 2016-01, Vol.45 (4), p.1563-1581

2016

Volltextzugriff (PDF)

Efficient Classification for Metric Data

IEEE transactions on information theory, 2014-09, Vol.60 (9), p.5750-5759

2014

Volltextzugriff (PDF)

Using Support Vector Machine (SVM) with GPS Ionospheric TEC Estimations to Potentially Predict Earthquake Events

Remote sensing (Basel, Switzerland), 2022-06, Vol.14 (12), p.2822

2022

Volltextzugriff (PDF)

Apportioned margin approach for cost sensitive large margin classifiers

Annals of mathematics and artificial intelligence, 2021-12, Vol.89 (12), p.1215-1235

2021

Volltextzugriff (PDF)

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.1028-1041

2021

Volltextzugriff (PDF)

A Nonlinear Approach to Dimension Reduction

Discrete & computational geometry, 2015-09, Vol.54 (2), p.291-315

2015

Volltextzugriff (PDF)

A computational analysis of the special Talmudic tractates

Journal of Jewish studies, 2024-04, Vol.75 (1), p.1-27

2024

Volltextzugriff (PDF)

Optimizing budget allocation for center and median points

Theoretical computer science, 2016-05, Vol.627, p.13-25

2016

Volltextzugriff (PDF)

Proximity Algorithms for Nearly Doubling Spaces

SIAM journal on discrete mathematics, 2013-01, Vol.27 (4), p.1759-1769

2013

Volltextzugriff (PDF)

Predicting Subscriber Usage: Analyzing Multidimensional Time-Series Using Convolutional Neural Networks

Cyber Security, Cryptology, and Machine Learning, 2022, Vol.13301, p.259-269

2022

Volltextzugriff (PDF)

VC bounds on the cardinality of nearly orthogonal function classes

Discrete mathematics, 2012-05, Vol.312 (10), p.1766-1775

2012

Volltextzugriff (PDF)

Strong stability preserving properties of Runge-Kutta time discretization methods for linear constant coefficient operators

Journal of scientific computing, 2003-02, Vol.18 (1), p.83-109

2003

Volltextzugriff (PDF)

The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme

Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, p.663-672

2012

Volltextzugriff (PDF)

Searching dynamic point sets in spaces with bounded doubling dimension

Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing; 21-23 May 2006, 2006, p.574-583

2006

Volltextzugriff (PDF)

Matrix Sparsification and the Sparse Null Space Problem

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2010, p.205-218

2010

Volltextzugriff (PDF)

1 – 25 von 42

Menü

Weitere Dienste

Einstellungen

Efficient Regression in Metric Spaces via Approximate Lipschitz Extension

Near-Optimal Sample Compression for Nearest Neighbors

Learning Convex Polyhedra With Margin

Non-uniform packings

Using Support Vector Machine (SVM) and Ionospheric Total Electron Content (TEC) Data for Solar Flare Predictions

Predicting Eastern Mediterranean Flash Floods Using Support Vector Machines with Precipitable Water Vapor, Pressure, and Lightning Data

Matrix Sparsification and the Sparse Null Space Problem

Faster algorithms for orienteering and k-TSP

Adaptive metric dimensionality reduction

Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

Efficient Classification for Metric Data

Using Support Vector Machine (SVM) with GPS Ionospheric TEC Estimations to Potentially Predict Earthquake Events

Apportioned margin approach for cost sensitive large margin classifiers

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces

A Nonlinear Approach to Dimension Reduction

A computational analysis of the special Talmudic tractates

Optimizing budget allocation for center and median points

Proximity Algorithms for Nearly Doubling Spaces

Predicting Subscriber Usage: Analyzing Multidimensional Time-Series Using Convolutional Neural Networks

VC bounds on the cardinality of nearly orthogonal function classes

Strong stability preserving properties of Runge-Kutta time discretization methods for linear constant coefficient operators

The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme

Searching dynamic point sets in spaces with bounded doubling dimension

Matrix Sparsification and the Sparse Null Space Problem

Suchergebnisse filtern