Sciweavers

40 search results - page 4 / 8
» Faster subtree isomorphism
Sort
View
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
ASIACRYPT
2007
Springer
14 years 1 months ago
Faster Addition and Doubling on Elliptic Curves
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
Daniel J. Bernstein, Tanja Lange
BMCBI
2010
183views more  BMCBI 2010»
13 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
13 years 11 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 9 months ago
Parallel Classification for Data Mining on Shared-Memory Multiprocessors
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parall...
Mohammed Javeed Zaki, Ching-Tien Ho, Rakesh Agrawa...