Results 1  10
of
32,058
Cooman. Constructing possibility measures
 Proceedings of the Joint Third International Symposium on Uncertainty Modeling and Analysis and Annual Conference of the North American Fuzzy Information Processing Society, pages 472477, Los Alamitos
, 1995
"... In this paper, we address some aspects of the extension problem for possibility measures: given the values that a (fuzzy) set mapping takes on a family of (fuzzy) sets, is it possible to extend this mapping to a possibility measure? This problem is shown to be equivalent to a special system of relat ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we address some aspects of the extension problem for possibility measures: given the values that a (fuzzy) set mapping takes on a family of (fuzzy) sets, is it possible to extend this mapping to a possibility measure? This problem is shown to be equivalent to a special system
Guarded Commands, Nondeterminacy and Formal Derivation of Programs
, 1975
"... Socalled "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract

Cited by 527 (0 self)
 Add to MetaCart
Socalled "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1047 (23 self)
 Add to MetaCart
are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.
Construction of genetic linkage map in man using restriction fragment length polymorphisom
 Am. J. Hum Genet
"... We describe a new basis for the construction of a genetic linkage map of the human genome. The basic principle of the mapping scheme is to develop, by recombinant DNA techniques, random singlecopy DNA probes capable of detecting DNA sequence polymorphisms, when hybridized to restriction digests of ..."
Abstract

Cited by 456 (1 self)
 Add to MetaCart
We describe a new basis for the construction of a genetic linkage map of the human genome. The basic principle of the mapping scheme is to develop, by recombinant DNA techniques, random singlecopy DNA probes capable of detecting DNA sequence polymorphisms, when hybridized to restriction digests
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
How to leak a secret
 PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY
, 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract

Cited by 2580 (4 self)
 Add to MetaCart
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures
Spacetime block codes from orthogonal designs
 IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract

Cited by 1524 (42 self)
 Add to MetaCart
decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space–time block codes. It is shown that space–time block codes constructed in this way only exist for few sporadic values of �. Subsequently, a generalization of orthogonal designs is shown to provide
Metabolic stability and epigenesis in randomly connected nets
 Journal of Theoretical Biology
, 1969
"... “The world is either the effect of cause or chance. If the latter, it is a world for all that, that is to say, it is a regular and beautiful structure.” Marcus Aurelius Protoorganisms probably were randomly aggregated nets of chemical reactions. The hypothesis that contemporary organisms are also r ..."
Abstract

Cited by 657 (5 self)
 Add to MetaCart
randomly constructed molecular automata is examined by modeling the gene as a binary (onoff) device and studying the behavior of large, randomly constructed nets of these binary “genes”. The results suggest that, if each “gene ” is directly affected by two or three other “genes”, then such random nets
Detectability of Discrete Event Systems
"... In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial ev ..."
Abstract

Cited by 806 (14 self)
 Add to MetaCart
event observation and/or partial state observation, which leads to four possible cases. We further define four types of detectabilities: strong detectability, (weak) detectability, strong periodic detectability, and (weak) periodic detectability. We derive necessary and sufficient conditions
Fast Planning Through Planning Graph Analysis
 ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid pla ..."
Abstract

Cited by 1171 (3 self)
 Add to MetaCart
We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid
Results 1  10
of
32,058