3395 search results - page 357 / 679 » Designs, Disputes and Strategies |
167
click to vote
ISSAC
2007
Springer
16 years 27 days ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
202
click to vote
IWINAC
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
194
click to vote
PSIVT
2007
Springer
16 years 26 days ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
149
click to vote
PVM
2007
Springer
16 years 26 days ago
2007
Springer
We propose a parallel MPI search engine that is capable of automatically switching between asynchronous message passing and bulk-synchronous message passing modes of operation. Whe...
171
click to vote
SAMOS
2007
Springer
16 years 26 days ago
2007
Springer
The computational demand of signal processing algorithms is rising continuously. Heterogeneous embedded multiprocessor systems-on-chips are one solution to tackle this demand. But ...