Sciweavers

431 search results - page 79 / 87
» Failure or Success
Sort
View
POPL
2009
ACM
16 years 4 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
132
Voted
MOBISYS
2009
ACM
16 years 3 months ago
SolarStore: enhancing data reliability in solar-powered storage-centric sensor networks
In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....
Yong Yang, Lili Wang, Dong Kun Noh, Hieu Khac Le, ...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 3 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
82
Voted
ICCAD
2006
IEEE
122views Hardware» more  ICCAD 2006»
16 years 7 days ago
Fill for shallow trench isolation CMP
Shallow trench isolation (STI) is the mainstream CMOS isolation technology. It uses chemical mechanical planarization (CMP) to remove excess of deposited oxide and attain a planar...
Andrew B. Kahng, Puneet Sharma, Alexander Zelikovs...
SOSP
2007
ACM
16 years 7 days ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...