Sciweavers

59 search results - page 6 / 12
» esa 2005
Sort
View
ESA
2005
Springer
89views Algorithms» more  ESA 2005»
14 years 3 months ago
Experimental Study of Geometric t-Spanners
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
Mohammad Farshi, Joachim Gudmundsson
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
14 years 3 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle
ESAS
2005
Springer
14 years 3 months ago
An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices
Abstract. One of the most frequent operations in modern cryptosystems is a multi-scalar multiplication with two scalars. Common methods to compute it are the Shamir method and the ...
Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
14 years 3 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
14 years 3 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin