Sciweavers

Share
20 search results - page 1 / 4
» wea 2010
Sort
View
WEA
2010
Springer
208views Algorithms» more  WEA 2010»
9 years 5 months ago
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuse...
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
10 years 1 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
10 years 1 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
WEA
2010
Springer
344views Algorithms» more  WEA 2010»
10 years 1 months ago
Alternative Routes in Road Networks
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
Ittai Abraham, Daniel Delling, Andrew V. Goldberg,...
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
9 years 4 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
books