Sciweavers

1213 search results - page 141 / 243
» Power scalable processing using distributed arithmetic
Sort
View
TAAS
2008
70views more  TAAS 2008»
14 years 9 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
EUROPAR
2008
Springer
14 years 11 months ago
Complex Queries for Moving Object Databases in DHT-Based Systems
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
Cecilia Hernández, M. Andrea Rodrígu...
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 1 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
ISCA
2009
IEEE
159views Hardware» more  ISCA 2009»
15 years 4 months ago
End-to-end register data-flow continuous self-test
While Moore’s Law predicts the ability of semi-conductor industry to engineer smaller and more efficient transistors and circuits, there are serious issues not contemplated in t...
Javier Carretero, Pedro Chaparro, Xavier Vera, Jau...
GI
2004
Springer
15 years 3 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner