Sciweavers

2124 search results - page 356 / 425
» Repairing Structurally Complex Data
Sort
View
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
ISMDA
2005
Springer
14 years 2 months ago
The Ontological Lens: Zooming in and out from Genomic to Clinical Level
Abstract. Ontology is the talk of the day in the medical informatics comm.unity. Its relevant role in the design and implementation of information systems in health care is now wid...
Domenico M. Pisanelli, Francesco Pinciroli, Marco ...
BIRTHDAY
2004
Springer
14 years 2 months ago
Der 'Nietzsche-Thesaurus' des Nietzsche-Online-Portals
The ‚Nietzsche-Thesaurus’ ist part of an Internet-Portal to the German philosopher Friedrich Nietzsche (under construction). By using the complex Index of a Citation Lexicon (...
Harald Zimmermann
ICCSA
2004
Springer
14 years 2 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
KI
2004
Springer
14 years 2 months ago
Shape-Based Robot Mapping
We present a novel geometric model for robot mapping suited for robots equipped with a laser range finder. The geometric representation is based on shape. Cyclic ordered sets of p...
Diedrich Wolter, Longin Jan Latecki, Rolf Lakä...