Results 1  10
of
6,349
Proofs of partial knowledge and simplified design of witness hiding protocols
, 1994
"... Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness indistinguishab ..."
Abstract

Cited by 335 (14 self)
 Add to MetaCart
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness
Reasoning with Partial Knowledge
, 2000
"... We investigate how sociological argumentation differs from the classical firstorder logic. We focus on theories about age dependence of organizational mortality. The overall pattern of argument does not comply with the classical monotonicity principle: adding premises does not overturn conclusio ..."
Abstract
 Add to MetaCart
conclusions in an argument. The cause of nonmonotonicity is the need to derive conclusions from partial knowledge. We identify metaprinciples that appear to guide the observed sociological argumentation patterns, and we formalize a semantics to represent them. This semantics yields a new kind of logical
Composing Complete and Partial Knowledge
, 1998
"... The representation of knowledge in the logic OLPFOL [8], [7], is split in two parts: writing definitions for known concepts, and writing constraints, expressing partial knowledge on other concepts. This is reflected in an OLPFOL theory T , which is a pair: T = (T d ; T c ). The definition part T d ..."
Abstract
 Add to MetaCart
The representation of knowledge in the logic OLPFOL [8], [7], is split in two parts: writing definitions for known concepts, and writing constraints, expressing partial knowledge on other concepts. This is reflected in an OLPFOL theory T , which is a pair: T = (T d ; T c ). The definition part
Classification in the KLONE knowledge representation system
 COGNITIVE SCIENCE
, 1985
"... KLONE lets one define and use a class of descriptive terms called Concepts, where each Concept denotes a set of objects A subsumption relation between Concepts is defined which is related to set inclusion by way of a semantics for Concepts. This subsumption relation defines a partial order on Conce ..."
Abstract

Cited by 673 (8 self)
 Add to MetaCart
KLONE lets one define and use a class of descriptive terms called Concepts, where each Concept denotes a set of objects A subsumption relation between Concepts is defined which is related to set inclusion by way of a semantics for Concepts. This subsumption relation defines a partial order
Batch Proofs of Partial Knowledge
"... We present a practical attack on soundness in Peng and Bao’s ‘batch zeroknowledge proof and verification’ protocol for proving knowledge and equality of oneoutofn pairs of discrete logarithms. Fixing the protocol seems to require a commitment scheme with a nonstandard, mercurialesque binding pr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a practical attack on soundness in Peng and Bao’s ‘batch zeroknowledge proof and verification’ protocol for proving knowledge and equality of oneoutofn pairs of discrete logarithms. Fixing the protocol seems to require a commitment scheme with a nonstandard, mercurialesque binding
Collaborative plans for complex group action
, 1996
"... The original formulation of SharedPlans by B. Grosz and C. Sidner ( 1990) was developed to provide a model of collaborative planning in which it was not necessary for one agent to have intentionsto toward an act of a different agent. Unlike other contemporaneous approaches (J.R. Searle, 1990), this ..."
Abstract

Cited by 543 (30 self)
 Add to MetaCart
not adequately deal with agents having only partial knowledge of the way in which to perform an action. This paper provides a revised and expanded version of SharedPlans that addresses these shortcomings. It also reformulates Pollack’s ( 1990) definition of individual plans to handle cases in which a single
Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information
, 2006
"... This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result of this pa ..."
Abstract

Cited by 2632 (50 self)
 Add to MetaCart
This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result
Search Profiling with Partial Knowledge of Deterrence
 F385F401 Manski C. (2007), Identification for Prediction and Decision
, 2006
"... Consider the choice of a profiling policy where decisions to search for evidence of crime may vary with observable covariates of the persons at risk of search. I pose a planning problem whose objective is to minimise the social cost of crime and search. The consequences of a search rule depend on th ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
on the extent to which search deters crime. I study the planning problem when the planner has partial knowledge of deterrence. I show how the planner can eliminate dominated search rules and how he can use the minimax or minimaxregret criterion to choose an undominated rule. Economists engaged in normative
Data Compression Using Adaptive Coding and Partial String Matching
 IEEE TRANSACTIONS ON COMMUNICATIONS
, 1984
"... The recently developed technique of arithmetic coding, in conjunction with a Markov model of the source, is a powerful method of data compression in situations where a linear treatment is inappropriate. Adaptive coding allows the model to be constructed dynamically by both encoder and decoder during ..."
Abstract

Cited by 442 (20 self)
 Add to MetaCart
of the message is sent. This paper describes how the conflict can be resolved with partial string matching, and reports experimental results which show that mixedcase English text can be coded in as little as 2.2 bits/ character with no prior knowledge of the source.
Results 1  10
of
6,349