Sciweavers

6568 search results - page 359 / 1314
» Reducing the Complexity of Reductions
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
16 years 8 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
OSDI
2008
ACM
16 years 7 months ago
Greening the Switch
Active research is being conducted in reducing power consumption of all the components of the Internet. To that end, we propose schemes for power reduction in network switches - T...
Ganesh Ananthanarayanan, Randy H. Katz
ICCD
2004
IEEE
114views Hardware» more  ICCD 2004»
16 years 4 months ago
Low Energy, Highly-Associative Cache Design for Embedded Processors
Many embedded processors use highly associative data caches implemented using a CAM-based tag search. When high-associativity is desirable, CAM designs can offer performance advan...
Alexander V. Veidenbaum, Dan Nicolaescu
162
Voted
ACSD
2009
IEEE
118views Hardware» more  ACSD 2009»
16 years 2 months ago
Verifying Deadlock- and Livelock Freedom in an SOA Scenario
In a service-oriented architecture (SOA), a service broker assigns a previously published service (stored in a service registry) to a service requester. It is desirable for the co...
Karsten Wolf, Christian Stahl, Janine Ott, Robert ...
AOSD
2009
ACM
16 years 2 months ago
Automated test data generation for aspect-oriented programs
Despite the upsurge of interest in the Aspect-Oriented Programming (AOP) paradigm, there remain few results on test data generation techniques for AOP. Furthermore, there is no wo...
Mark Harman, Fayezin Islam, Tao Xie, Stefan Wapple...