Sciweavers

251 search results - page 8 / 51
» On Modular Decomposition of Integers
Sort
View
LMCS
2006
119views more  LMCS 2006»
13 years 7 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 7 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
ARITH
2005
IEEE
14 years 1 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
EUROCRYPT
2010
Springer
14 years 6 days ago
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...
ECOOP
2004
Springer
13 years 11 months ago
Programming with Crosscutting Effective Views
Abstract. Aspect-oriented systems claim to improve modularity by providing explicit mechanisms that allow modularization of concerns which crosscut the object-oriented decompositio...
Doug Janzen, Kris De Volder