Results 1  10
of
428
Formallanguageconstrained path problems
 SIAM Journal on Computing
, 2000
"... Abstract. Given an alphabet Σ, a (directed) graph G whose edges are weighted and Σlabeled, and a formal language L ⊆ Σ ∗ , the formallanguageconstrained shortest/simple path problem consists of finding a shortest (simple) path p in G complying with the additional constraint that l(p) ∈ L. Here l ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
regular languages and to very simple classes of graphs (e.g., complete grids). (3) For the class of treewidthbounded graphs, we show that (i) the problem of finding a regularlanguageconstrained simple path between source and destination is solvable in polynomial time and (ii) the extension to finding
On the Compressibility of NP Instances and Cryptographic Applications
"... We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of N P decision problems. We consider N P problems that have long instances but relatively short witnesses. The question is, can one efficientl ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
efficiently compress an instance and store a shorter representation that maintains the information of whether the original input is in the language or not. We want the length of the compressed instance to be polynomial in the length of the witness and polylog in the length of original input. We discuss
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil
Tree Matching Problems with Applications to Structured Text Databases
, 1992
"... Tree matching is concerned with finding the instances, or matches, of a given pattern tree in a given target tree. We introduce ten interrelated matching problems called tree inclusion problems. A specific tree inclusion problem is defined by specifying the trees that are instances of the patterns. ..."
Abstract

Cited by 83 (0 self)
 Add to MetaCart
. The problems differ from each other in the amount of similarity required between the patterns and their instances. We present and analyze algorithms for solving these problems, and show that the computational complexities of the problems range from linear to NPcomplete. The problems are motivated by the study
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
reward with increasing probability Expected Value Parietal neurons show increasing taskrelated activations with both the magnitude and probability of reward that do not seem to distinguish between the two components of expected value Uncertainty Graphical analysis and application of the Laplace
Witness Encryption and its Applications
"... We put forth the concept of witness encryption. A witness encryption scheme is defined for an NP language L (with corresponding witness relation R). In such a scheme, a user can encrypt a message M to a particular problem instance x to produce a ciphertext. A recipient of a ciphertext is able to dec ..."
Abstract

Cited by 41 (9 self)
 Add to MetaCart
x is actually in the language. Our contributions in this paper are threefold. First, we introduce and formally define witness encryption. Second, we show how to build several cryptographic primitives from witness encryption. Finally, we give a candidate construction based on the NPcomplete Exact
Containment and equivalence for a fragment of XPath
 JOURNAL OF THE ACM
, 2004
"... XPath is a language for navigating an XML document and selecting a set of element nodes. XPath expressions are used to query XML data, describe key constraints, express transformations, and reference elements in remote documents. This article studies the containment and equivalence problems for a ..."
Abstract

Cited by 142 (0 self)
 Add to MetaCart
XPath is a language for navigating an XML document and selecting a set of element nodes. XPath expressions are used to query XML data, describe key constraints, express transformations, and reference elements in remote documents. This article studies the containment and equivalence problems for a
Generating instance models from meta models. In Formal Methods for Open ObjectBased Distributed Systems;
, 2006
"... Abstract. Meta modeling is a widespread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the meta modeling approach has one disadvantage: It is not constructive i. e. it does not offer a direct means o ..."
Abstract

Cited by 49 (4 self)
 Add to MetaCart
of generating instances of the language. This disadvantage poses a severe limitation for certain applications. For example, when developing model transformations, it is desirable to have enough valid instance models available for largescale testing. Producing such a large set by hand is tedious. In the related
Formal Language Constrained Path Problems
 Los Alamos National Laboratory, LAUR
, 1998
"... Given an alphabet \Sigma, a (directed) graph G whose edges are weighted and \Sigmalabeled, and a formal language L ` \Sigma , we consider the problem of finding a shortest (simple) path p in G complying with the additional constraint that l(p) 2 L. Here l(p) denotes the unique word given by con ..."
Abstract
 Add to MetaCart
in polynomial time. When the mode choice is specified as a regular language we provide algorithms with improved space and time bounds. 2. In contrast, we show that the problem of finding simple paths between a source and a given destination is NPhard, even when restricted to fixed simple regular languages
A Formal Languages Characterization of NP
, 1999
"... . This paper establishes a link between computational complexity theory and formal language theory of multidimensional words. Let ncube(x) be the ndimensional word in which a 1dimensional word x is padded with blanks to form an ndimensional cube. Call a 1dimensional language ndimensionally ..."
Abstract
 Add to MetaCart
) is obtained for P. Using more general acceptance criteria one can also characterize counting classes like PP or UP via coverability. 1 Introduction The original and usual master problem for NPcompleteness is SAT [Co71]. Master problem means that an arbitrary polynomial time nondeterministic computation
Results 1  10
of
428