46 search results - page 2 / 10 » A low complexity probabilistic test for integer multiplicati... |
BSN
2009
IEEE
14 years 18 days ago
2009
IEEE
Wireless systems that form a body-area network must be made small and low power without sacrificing performance. To achieve high-throughput communication in low-cost wireless bod...
SPAA
1990
ACM
13 years 9 months ago
1990
ACM
We present various experiments in Hardware/Software designtradeoffs met in speeding up long integer multiplications. This work spans over a year, with more than 12 different hardw...
IAAI
2003
13 years 7 months ago
2003
In addition to being accurate, it is important that diagnostic systems for use in automobiles also have low development and hardware costs. Model-based methods have shown promise ...
ISSAC
2001
Springer
13 years 10 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...