1213 search results - page 41 / 243 » Power scalable processing using distributed arithmetic |
HASE
2008
IEEE
14 years 4 months ago
2008
IEEE
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
IM
2003
13 years 11 months ago
2003
: In a dynamically scalable hosting infrastructure for e-business computing, servers need to be quickly allocated in order to satisfy a sudden demand for increased computing power ...
EUROCRYPT
2012
Springer
12 years 9 days ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
AAECC
2007
Springer
14 years 4 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
GIS
2007
ACM
14 years 11 months ago
2007
ACM
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...