Sciweavers

2168 search results - page 367 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
132
Voted
ICALP
2005
Springer
15 years 9 months ago
Single-Database Private Information Retrieval with Constant Communication Rate
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Craig Gentry, Zulfikar Ramzan
115
Voted
ISLPED
2003
ACM
113views Hardware» more  ISLPED 2003»
15 years 9 months ago
Reducing power density through activity migration
Power dissipation is unevenly distributed in modern microprocessors leading to localized hot spots with significantly greater die temperature than surrounding cooler regions. Exc...
Seongmoo Heo, Kenneth C. Barr, Krste Asanovic
LCTRTS
2001
Springer
15 years 8 months ago
Combining Global Code and Data Compaction
Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of pro...
Bjorn De Sutter, Bruno De Bus, Koenraad De Bossche...
151
Voted
DEXAW
1999
IEEE
152views Database» more  DEXAW 1999»
15 years 8 months ago
Advanced Metrics for Class-Driven Similarity Search
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
Paolo Avesani, Enrico Blanzieri, Francesco Ricci
129
Voted
CAV
2006
Springer
116views Hardware» more  CAV 2006»
15 years 7 months ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...