Sciweavers

1058 search results - page 136 / 212
» It's Doomed; We Can Prove It
Sort
View
MICRO
2000
IEEE
98views Hardware» more  MICRO 2000»
14 years 2 months ago
The store-load address table and speculative register promotion
Register promotion is an optimization that allocates a value to a register for a region of its lifetime where it is provably not aliased. Conventional compiler analysis cannot alw...
Matt Postiff, David Greene, Trevor N. Mudge
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 2 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
CSFW
2010
IEEE
14 years 1 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CIKM
2008
Springer
14 years 4 hour ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church
MM
2010
ACM
146views Multimedia» more  MM 2010»
13 years 10 months ago
Understanding the security and robustness of SIFT
Many content-based retrieval systems (CBIRS) describe images using the SIFT local features because of their very robust recognition capabilities. While SIFT features proved to cop...
Thanh-Toan Do, Ewa Kijak, Teddy Furon, Laurent Ams...