13376 search results - page 286 / 2676 » Problem Solving with |
144
click to vote
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
125
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
159
click to vote
ICTAI
2010
IEEE
15 years 1 months ago
2010
IEEE
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
114
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
130
click to vote
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...