Sciweavers

251 search results - page 10 / 51
» On Modular Decomposition of Integers
Sort
View
ECOOP
2004
Springer
15 years 3 months ago
OASIS: Organic Aspects for System Infrastructure Software Easing Evolution and Adaptation through Natural Decomposition
It is becoming increasingly clear that we are entering a new era in systems software. As the age-old tension between structure and performance acquiesces, we can finally venture b...
Celina Gibbs, Yvonne Coady
IIWAS
2004
14 years 11 months ago
Decomposition and Reuse of Mobile Services
: Today, the development of new mobile services is associated with high costs and risks. The main aim of our research is to make this development process faster and more efficient ...
Elisabeth Dörr, Werner Winiwarter
EUROCRYPT
2004
Springer
15 years 3 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
CCCG
2008
14 years 11 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
WG
2007
Springer
15 years 3 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...