397 search results - page 49 / 80 » Lifting of divisible designs |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
FGCS
2006
13 years 9 months ago
2006
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
CANS
2011
Springer
12 years 9 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present a novel approach for Medium Access Control (MAC) protocol design based on protocol engine. Current way of designing MAC protocols for a specific application is based...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
One of the efficient design methodologies for large scale System on a Chip (SoC) is IP-based design. In this methodology, a system is considered as a set of components and intercon...