Sciweavers

607 search results - page 73 / 122
» Unifying Exact Completions
Sort
View
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
15 years 6 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
UML
2001
Springer
15 years 3 months ago
Agile Modeling: A Brief Overview
: Agile Modeling (AM) is a practice-based methodology for effective modeling of software-based systems. Where the Unified Modeling Language (UML) defines a subset of the modeling t...
Scott W. Ambler
NAACL
2003
15 years 11 days ago
An Analysis of Clarification Dialogue for Question Answering
We examine clarification dialogue, a mechanism for refining user questions with follow-up questions, in the context of open domain Question Answering systems. We develop an algori...
Marco De Boni, Suresh Manandhar
CORR
2010
Springer
249views Education» more  CORR 2010»
14 years 11 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CORR
2008
Springer
105views Education» more  CORR 2008»
14 years 11 months ago
Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability
Equivocation has been widely used as a measure of security after Shannon[10]. For an infinite system such as the wiretap channel defined in [2], equivocation is unbounded and so e...
Chung Chan