Sciweavers

251 search results - page 32 / 51
» On Modular Decomposition of Integers
Sort
View
JOT
2010
76views more  JOT 2010»
14 years 8 months ago
A Program Transformation Technique to Support AOP within C++ Template
Aspect-oriented programming (AOP) provides assistance in modularizing concerns that crosscut the boundaries of system decomposition. Aspects have the potential to interact with ma...
Suman Roychoudhury, Jeff Gray, Jing Zhang, Purusho...
91
Voted
OOPSLA
2004
Springer
15 years 3 months ago
Resolving feature convolution in middleware systems
Middleware provides simplicity and uniformity for the development of distributed applications. However, the modularity of the architecture of middleware is starting to disintegrat...
Charles Zhang, Hans-Arno Jacobsen
MYCRYPT
2005
Springer
189views Cryptology» more  MYCRYPT 2005»
15 years 3 months ago
An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = kˆ i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤   c + o(1) ¡ log n log log n ....
Mathieu Ciet, Francesco Sica
90
Voted
ICCAD
2007
IEEE
234views Hardware» more  ICCAD 2007»
15 years 1 months ago
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon ...
CASES
2004
ACM
15 years 3 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...