7195 search results - page 356 / 1439 » On Computing Power |
180
click to vote
ISSAC
2004
Springer
16 years 3 days ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
202
click to vote
MWCN
2004
Springer
16 years 3 days ago
2004
Springer
This paper analyzes the energy consumption of ad hoc nodes using IEEE 802.11 interfaces. Our objective is to provide theoretical limits on the lifetime gains that can be achieved b...
161
click to vote
AMAI
2000
Springer
15 years 11 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
178
click to vote
DAC
2007
ACM
15 years 10 months ago
2007
ACM
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
218
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...