Sciweavers

1763 search results - page 217 / 353
» A Formalization of Polytime Functions
Sort
View
IPM
2006
83views more  IPM 2006»
14 years 10 months ago
A risk minimization framework for information retrieval
This paper presents a probabilistic information retrieval framework in which the retrieval problem is formally treated as a statistical decision problem. In this framework, querie...
ChengXiang Zhai, John D. Lafferty
MSS
2008
IEEE
82views Hardware» more  MSS 2008»
14 years 10 months ago
Revealed preference and indifferent selection
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
Eric Danan
SIGPLAN
2008
14 years 10 months ago
Verified enforcement of stateful information release policies
Many organizations specify information release policies to describe the terms under which sensitive information may be released to other organizations. This paper presents a new a...
Nikhil Swamy, Michael Hicks
TC
2008
14 years 10 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
TCS
2008
14 years 10 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun