Sciweavers

848 search results - page 83 / 170
» Randomness and the linear degrees of computability
Sort
View
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
15 years 6 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
PERCOM
2007
ACM
15 years 11 months ago
Dynamic Carrier-Assisted Routing in Mobile Networks
We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for ...
Jie Wu
CEC
2010
IEEE
15 years 1 months ago
On the role of modularity in evolutionary dynamic optimisation
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
Philipp Rohlfshagen, Xin Yao
ICIP
2006
IEEE
16 years 1 months ago
An Architecture for Compressive Imaging
Compressive Sensing is an emerging field based on the revelation that a small group of non-adaptive linear projections of a compressible signal contains enough information for rec...
Michael B. Wakin, Jason N. Laska, Marco F. Duarte,...
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 5 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...