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

Transportation Problem Allowing Sending and Bringing Back

International journal of foundations of computer science, 2023-08, Vol.34 (5), p.487-505

Asano, Tetsuo

2023

Volltextzugriff (PDF)

Transportation problem on a graph

Japan journal of industrial and applied mathematics, 2023, Vol.40 (1), p.289-302

Asano, Tetsuo

2023

Volltextzugriff (PDF)

Do We Need a Stack to Erase a Component in a Binary Image?

Fun with Algorithms, 2010, p.16-27

2010

Volltextzugriff (PDF)

Constant-Working-Space Algorithms for Image Processing

Emerging Trends in Visual Computing, p.268-283

Volltextzugriff (PDF)

Chemical ablation of the left ventricular endocardium reduces ventricular fibrillation inducibility in acute ischemic canine heart

Journal of arrhythmia, 2024-04, Vol.40 (2), p.325-332

2024

Volltextzugriff (PDF)

Algorithms and Computation: 7th International Symposium, ISAAC '96 Osaka, Japan, December 16–18, 1996 Proceedings

1996

Volltextzugriff (PDF)

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands

International journal of foundations of computer science, 2023-11, Vol.34 (7), p.693-714

Asano, Tetsuo

2023

Volltextzugriff (PDF)

In-place Algorithm for Erasing a Connected Component in a Binary Image

Theory of computing systems, 2012-01, Vol.50 (1), p.111-123

Asano, Tetsuo

2012

Volltextzugriff (PDF)

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

Algorithms and Data Structures, p.61-72

Volltextzugriff (PDF)

Algorithms: International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings

1990

Volltextzugriff (PDF)

In-Place Linear-Time Algorithms for Euclidean Distance Transform

Transactions on Computational Science VIII, 2010-01, p.103-113

2010

Volltextzugriff (PDF)

Memory-constrained algorithms for simple polygons

Computational geometry : theory and applications, 2013-10, Vol.46 (8), p.959-969

2013

Volltextzugriff (PDF)

Faster computation of the Robinson–Foulds distance between phylogenetic networks

Information sciences, 2012-08, Vol.197, p.77-90

2012

Volltextzugriff (PDF)

Reprint of: Memory-constrained algorithms for simple polygons

Computational geometry : theory and applications, 2014-04, Vol.47 (3), p.469-479

2014

Volltextzugriff (PDF)

Reporting All Segment Intersections Using an Arbitrary Sized Work Space

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2013, Vol.E96.A (6), p.1066-1071

2013

Volltextzugriff (PDF)

Constant-work-space algorithms for geometric problems

Journal of computational geometry, 2011-07, Vol.2 (1)

2011

Volltextzugriff (PDF)

A Small-Space Algorithm for Removing Small Connected Components from a Binary Image

IEICE transactions on fundamentals of electronics, communications and computer sciences, 2013, Vol.E96.A (6), p.1044-1050

2013

Volltextzugriff (PDF)

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Journal of graph algorithms and applications, 2011, Vol.15 (5), p.569-586

2011

Volltextzugriff (PDF)

Some theoretical challenges in digital geometry: A perspective

Discrete Applied Mathematics, 2009-08, Vol.157 (16), p.3362-3371

2009

Volltextzugriff (PDF)

A New Transportation Problem on a Graph with Sending and Bringing-Back Operations

WALCOM: Algorithms and Computation, p.13-24

Volltextzugriff (PDF)

Geometry, Morphology, and Computational Imaging: 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers

1, 2003

Volltextzugriff (PDF)

Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings

Asano, Tetsuo

1, 2006

Volltextzugriff (PDF)

Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures

Algorithms and Computation, 2006, p.557-566

2006

Volltextzugriff (PDF)

Algorithms and computation: 17th international symposium, ISAAC 2006, Kolkata, India December 18-20, 2006 : proceedings

Asano, Tetsuo

2014

Volltextzugriff (PDF)

In-Place Algorithm for Connected Components Labeling

Journal of pattern recognition research, 2010, Vol.5 (1), p.10-22

2010

Volltextzugriff (PDF)

1 – 25 von 799

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(636)
Mit Volltextzugriff
(699)

Publikationsform

Sprache

Englisch
(755)
Japanisch
(74)
Deutsch
(1)

Erscheinungsjahr

n.n

Thema

Science & Technology
(482)
Technology
(238)
Computer Science
(196)
Life Sciences & Biomedicine
(195)
Computer Science, Theory & Methods
(168)
Exact Sciences And Technology
(142)
Physical Sciences
(142)
Humans
(133)
Applied Sciences
(132)
Mathematics
(119)
Computer Science; Control Theory; Systems
(109)
Male
(102)
Mathematics, Applied
(98)
Animals
(95)
Female
(94)
Middle Aged
(75)
Theoretical Computing
(62)
Aged
(56)
Biological And Medical Sciences
(56)
Mice
(55)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Transportation Problem Allowing Sending and Bringing Back

Transportation problem on a graph

Do We Need a Stack to Erase a Component in a Binary Image?

Constant-Working-Space Algorithms for Image Processing

Chemical ablation of the left ventricular endocardium reduces ventricular fibrillation inducibility in acute ischemic canine heart

Algorithms and Computation: 7th International Symposium, ISAAC '96 Osaka, Japan, December 16–18, 1996 Proceedings

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands

In-place Algorithm for Erasing a Connected Component in a Binary Image

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

Algorithms: International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings

In-Place Linear-Time Algorithms for Euclidean Distance Transform

Memory-constrained algorithms for simple polygons

Faster computation of the Robinson–Foulds distance between phylogenetic networks

Reprint of: Memory-constrained algorithms for simple polygons

Reporting All Segment Intersections Using an Arbitrary Sized Work Space

Constant-work-space algorithms for geometric problems

A Small-Space Algorithm for Removing Small Connected Components from a Binary Image

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Some theoretical challenges in digital geometry: A perspective

A New Transportation Problem on a Graph with Sending and Bringing-Back Operations

Geometry, Morphology, and Computational Imaging: 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers

Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings

Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures

Algorithms and computation: 17th international symposium, ISAAC 2006, Kolkata, India December 18-20, 2006 : proceedings

In-Place Algorithm for Connected Components Labeling

Suchergebnisse filtern