88 search results - page 3 / 18 » Regular Cost Functions over Finite Trees |
IJNSEC
2010
13 years 4 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
SAS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
COMPSAC
2002
IEEE
14 years 2 months ago
2002
IEEE
a Abstract— Source code copying for reuse (code cloning) is often observed in software implementations. Such code cloning causes difficulty when software functionalities are mod...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
PODS
2005
ACM
14 years 9 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...