Sciweavers

107
Voted
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
15 years 5 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...
80
Voted
WEA
2009
Springer
145views Algorithms» more  WEA 2009»
15 years 7 months ago
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
Reinhard Bauer, Dorothea Wagner
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 7 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
77
Voted
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
15 years 7 months ago
Computing Elevation Maxima by Searching the Gauss Sphere
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...
Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
15 years 7 months ago
Measuring the Similarity of Geometric Graphs
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
Algorithms
Top of PageReset Settings