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

Finding the most vital node of a shortest path

Theoretical computer science, 2003-03, Vol.296 (1), p.167-177

2003

Volltextzugriff (PDF)

A reference architecture for the certification of E-services in a digital government infrastructure

Distributed and parallel databases : an international journal, 2002-09, Vol.12 (2-3), p.217-234

2002

Volltextzugriff (PDF)

A generalized comparison of linear representations of thematic layers

Data & knowledge engineering, 2001-04, Vol.37 (1), p.1-23

2001

Volltextzugriff (PDF)

A faster computation of the most vital edge of a shortest path

Information processing letters, 2001-06, Vol.79 (2), p.81-85

2001

Volltextzugriff (PDF)

ATM layouts with bounded hop count and congestion

Distributed computing, 2001-04, Vol.14 (2), p.65-73

2001

Volltextzugriff (PDF)

Efficient unbalanced merge–sort

Information sciences, 2006-01, Vol.176 (10), p.1321-1337

2006

Volltextzugriff (PDF)

A layout algorithm for data flow diagrams

IEEE transactions on software engineering, 1986-04, Vol.SE-12 (4), p.538-546

1986

Volltextzugriff (PDF)

SIM: a working example of an e-government service infrastructure for mountain communities

12th International Workshop on Database and Expert Systems Applications, 2001, p.407-411

2001

Volltextzugriff (PDF)

Swapping a failing edge of a single source shortest paths tree is good and fast

Algorithmica, 2003-01, Vol.35 (1), p.56-74

2003

Volltextzugriff (PDF)

On the creation of quadtrees by using a branching process

Image and vision computing, 1996, Vol.14 (2), p.159-164

1996

Volltextzugriff (PDF)

Algorithms for Moving Objects Databases

Computer journal, 2003, Vol.46 (6), p.680-712

2003

Volltextzugriff (PDF)

Nearly linear time minimum spanning tree maintenance for transient node failures

Algorithmica, 2004-10, Vol.40 (2), p.119-132

2004

Volltextzugriff (PDF)

An algorithm for testing planarity of hierarchical graphs

Graph-Theoretic Concepts in Computer Science, 1987-01, p.277-289

1987

Volltextzugriff (PDF)

Abstract data types for the logical modeling of complex data

Information systems (Oxford), 1991, Vol.16 (6), p.565-583

1991

Volltextzugriff (PDF)

An Infrastructural Approach to Secure Interoperability of Electronic IDs: The Bridging Backbone

Electronic Government, 2005, p.291-299

2005

Volltextzugriff (PDF)

An accurate model for quadtrees representing noiseless images of spatial data

Proceedings of 1st International Conference on Image Processing, 1994, Vol.2, p.610-614 vol.2

1994

Volltextzugriff (PDF)

A data model and data structures for moving objects databases

SIGMOD record, 2000-06, Vol.29 (2), p.319-330

2000

Volltextzugriff (PDF)

Finding the detour-critical edge of a shortest path between two nodes

Information processing letters, 1998-07, Vol.67 (1), p.51-54

1998

Volltextzugriff (PDF)

S-tree : An improved S+-tree for coloured images

Lecture notes in computer science, 1999, p.156-167

1999

Volltextzugriff (PDF)

A layered IT infrastructure for secure interoperability in personal data registry digital government services

14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings, 2004, p.95-102

2004

Volltextzugriff (PDF)

Experiences and issues in the realization of e-government services

Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002, 2002, p.143-148

2002

Volltextzugriff (PDF)