12373 search results - page 2 / 2475 » Semi-Logarithmic Number Systems |
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
ALGORITHMICA
2011
13 years 2 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
GD
2007
Springer
14 years 1 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
WIMOB
2007
IEEE
14 years 1 months ago
2007
IEEE
As part of the IEEE 802.16 protocol, the random access scheme is used for ranging. The ratio between the numbers of periodic ranging slots and data slots in the uplink subframe de...
FPL
2007
Springer
14 years 1 months ago
2007
Springer
Simple algorithms can be analytically characterized, but such analysis is questionable or even impossible for more complicated algorithms, such as Model Predictive Control (MPC). ...