3972 search results - page 626 / 795 » Palpability Support Demonstrated |
165
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
163
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
174
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
187
click to vote
OSDI
2002
ACM
16 years 6 months ago
2002
ACM
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
246
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...