Sciweavers

5639 search results - page 664 / 1128
» Timed Abstract Non-interference
Sort
View
173
Voted
ESAS
2007
Springer
16 years 17 days ago
Enabling Full-Size Public-Key Algorithms on 8-Bit Sensor Nodes
Abstract. In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro contro...
Leif Uhsadel, Axel Poschmann, Christof Paar
ICALP
2007
Springer
16 years 17 days ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
173
Voted
ICCS
2007
Springer
16 years 17 days ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...
ISAAC
2007
Springer
120views Algorithms» more  ISAAC 2007»
16 years 17 days ago
Succinct Representation of Labeled Graphs
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
Jérémy Barbay, Luca Castelli Aleardi...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 17 days ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh