Sciweavers

5699 search results - page 1138 / 1140
» Alternating model trees
Sort
View
JCDL
2011
ACM
221views Education» more  JCDL 2011»
13 years 15 days ago
Integrating implicit structure visualization with authoring promotes ideation
We need to harness the growing wealth of information in digital libraries to support intellectual work involving creative and exploratory processes. Prior research on hypertext au...
Andrew M. Webb, Andruid Kerne
ASIACRYPT
2011
Springer
12 years 9 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
ATAL
2011
Springer
12 years 9 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
CIKM
2011
Springer
12 years 9 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
12 years 9 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
« Prev « First page 1138 / 1140 Last » Next »