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...

Regular switching components

Theoretical computer science, 2019-07, Vol.777, p.338-355

Gerard, Yan

2019

Volltextzugriff (PDF)

Reconstruction of Convex Sets from One or Two X-rays

Fundamenta informaticae, 2023-08, Vol.189 (2), p.113-143

2023

Volltextzugriff (PDF)

About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness

Combinatorial Image Analysis, p.289-301

Volltextzugriff (PDF)

Shape-from-Template

IEEE transactions on pattern analysis and machine intelligence, 2015-10, Vol.37 (10), p.2099-2118

2015

Volltextzugriff (PDF)

About the Decidability of Polyhedral Separability in the Lattice $$\mathbb {Z}^d$$ Z d: Recognizing Digital Polyhedra with a Prescribed Number of Faces

Journal of mathematical imaging and vision, 2017-09, Vol.59 (1), p.52-68

Gerard, Yan

2017

Volltextzugriff (PDF)

About the Decidability of Polyhedral Separability in the Lattice Zd: Recognizing Digital Polyhedra with a Prescribed Number of Faces

Journal of mathematical imaging and vision, 2017, Vol.59 (1), p.52-68

Gerard, Yan

2017

Volltextzugriff (PDF)

About the Decidability of Polyhedral Separability in the Lattice $\mathbb {Z}^d: Recognizing Digital Polyhedra with a Prescribed Number of Faces

Journal of mathematical imaging and vision, 2017, Vol.59 (1), p.52-68

Gerard, Yan

2017

Volltextzugriff (PDF)

About the Decidability of Polyhedral Separability in the Lattice Z d

Journal of mathematical imaging and vision, 2017-01, Vol.59 (1), p.52-68

Yan, Gerard

2017

Volltextzugriff (PDF)

Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3

Discrete Geometry for Computer Imagery, p.279-290

Volltextzugriff (PDF)

Digital Level Layers for Digital Curve Decomposition and Vectorization

Image processing on line, 2014-01, Vol.4, p.169-186

2014

Volltextzugriff (PDF)

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons

Journal of mathematical imaging and vision, 2020-06, Vol.62 (5), p.693-703

2020

Volltextzugriff (PDF)

Computerized Tomography with Digital Lines and Linear Programming

Discrete Geometry for Computer Imagery, 2005, p.126-135

2005

Volltextzugriff (PDF)

Complexity results on untangling red-blue matchings

Computational geometry : theory and applications, 2023-04, Vol.111, p.101974, Article 101974

2023

Volltextzugriff (PDF)

About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length

Discrete Geometry for Computer Imagery, p.13-24

Volltextzugriff (PDF)

Periodic graphs and connectivity of the rational digital hyperplanes

Theoretical computer science, 2002-06, Vol.283 (1), p.171-182

GERARD, Yan

2002

Volltextzugriff (PDF)

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

The ACM journal of experimental algorithmics, 2022-03, Vol.27 (2.2), p.1-11, Article 2.2

2022

Volltextzugriff (PDF)

Additive Subsets

Combinatorial Image Analysis, 2006, p.347-353

2006

Volltextzugriff (PDF)

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length

Theoretical computer science, 2016-04, Vol.624, p.41-55

2016

Volltextzugriff (PDF)

Shadoks Approach to Low-Makespan Coordinated Motion Planning

The ACM journal of experimental algorithmics, 2022-12, Vol.27, p.1-17, Article 3.2

2022

Volltextzugriff (PDF)

A Question of Digital Linear Algebra

Discrete Geometry for Computer Imagery, 2000, p.126-136

2000

Volltextzugriff (PDF)

Spatial heterogeneity of type I error for local cluster detection tests

International journal of health geographics, 2014-05, Vol.13 (1), p.15-15

2014

Volltextzugriff (PDF)

The chords’ problem

Theoretical computer science, 2002-06, Vol.282 (2), p.319-336

2002

Volltextzugriff (PDF)

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

The ACM journal of experimental algorithmics, 2023-05, Vol.28, p.1-13, Article 1.2

2023

Volltextzugriff (PDF)

Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error

Discrete Geometry for Computer Imagery, p.284-295

Volltextzugriff (PDF)

Annexin A1 in primary tumors promotes melanoma dissemination

Clinical & experimental metastasis, 2014-10, Vol.31 (7), p.749-760

2014

Volltextzugriff (PDF)

1 – 25 von 505

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(435)
Mit Volltextzugriff
(459)

Publikationsform

2 weitere anzeigen...

Weniger anzeigen...

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(331)
Life Sciences & Biomedicine
(167)
Technology
(108)
Humans
(103)
Computer Science
(76)
Physical Sciences
(73)
Animals
(66)
Biological And Medical Sciences
(44)
Engineering
(42)
Male
(40)
Female
(37)
Mice
(36)
Science & Technology - Other Topics
(34)
Computer Science, Artificial Intelligence
(33)
Computer Science, Theory & Methods
(33)
Medical Sciences
(32)
Engineering, Electrical & Electronic
(30)
Life Sciences
(30)
Computational Geometry
(27)
Multidisciplinary Sciences
(26)

15 weitere anzeigen...

Weniger anzeigen...

Kollektion

Ingenta
(232)
EZB Electronic Journals Library
(217)
MEDLINE
(167)
Elsevier ScienceDirect Journals Complete
(99)
Journals@OVID
(97)
Publisher website
(96)
IngentaConnect Journals
(85)
Elsevier Journal Backfiles on ScienceDirect (DFG Nationallizenzen)
(55)
Wiley Online Library
(50)
IEEE Xplore
(41)
SpringerLink Series
(38)
SpringerLink
(27)
Nature Journals
(24)
Wiley Online Library
(23)
Jstor Complete Legacy
(22)
SpringerLINK Contemporary (Konsortium Baden-Württemberg)
(17)
Oxford University Press Journals Current
(12)
Nexis Uni
(10)
Ebook Central Perpetual and DDA
(9)
eBooks on EBSCOhost
(9)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(3)
... seit 90 Tagen
(8)

Menü

Weitere Dienste

Einstellungen

Regular switching components

Reconstruction of Convex Sets from One or Two X-rays

About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness

Shape-from-Template

About the Decidability of Polyhedral Separability in the Lattice $$\mathbb {Z}^d$$ Z d: Recognizing Digital Polyhedra with a Prescribed Number of Faces

About the Decidability of Polyhedral Separability in the Lattice Zd: Recognizing Digital Polyhedra with a Prescribed Number of Faces

About the Decidability of Polyhedral Separability in the Lattice $\mathbb {Z}^d: Recognizing Digital Polyhedra with a Prescribed Number of Faces

About the Decidability of Polyhedral Separability in the Lattice Z d

Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3

Digital Level Layers for Digital Curve Decomposition and Vectorization

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons

Computerized Tomography with Digital Lines and Linear Programming

Complexity results on untangling red-blue matchings

About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length

Periodic graphs and connectivity of the rational digital hyperplanes

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

Additive Subsets

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length

Shadoks Approach to Low-Makespan Coordinated Motion Planning

A Question of Digital Linear Algebra

Spatial heterogeneity of type I error for local cluster detection tests

The chords’ problem

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error

Annexin A1 in primary tumors promotes melanoma dissemination

Suchergebnisse filtern