Sciweavers

26354 search results - page 298 / 5271
» How we refactor, and how we know it
Sort
View
WWW
2011
ACM
15 years 1 months ago
Addressing people's information needs directly in a web search result page
Web search engines have historically focused on connecting people with information resources. For example, if a person wanted to know when their flight to Hyderabad was leaving, a...
Lydia B. Chilton, Jaime Teevan
TDSC
2010
119views more  TDSC 2010»
15 years 1 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
INFOCOM
2011
IEEE
14 years 10 months ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
14 years 9 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
CEAS
2006
Springer
15 years 10 months ago
Sender Reputation in a Large Webmail Service
In this paper, we describe how a large webmail service uses reputation to classify authenticated sending domains as either spammy or not spammy. Both SPF and DomainKey authenticat...
Bradley Taylor