Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
187
Minimizing NFA's and Regular Expressions
, 2005
"... We show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's). We show that it is impossible to e#ciently minimize a given nf ..."
Abstract
-
Cited by 32 (0 self)
- Add to MetaCart
We show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's). We show that it is impossible to e#ciently minimize a given
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
-coil array in brain imaging. With an array of five coils double-oblique heart images were obtained in one-third of conventional scan time. Magn Reson Med 42:952-962, 1999. 1999 Wiley-Liss, Inc. Key words: MRI; sensitivity encoding; SENSE; fast imaging; receiver coil array Among today's many medical
Minimized Thompson NFA
"... Abstract The problem of converting a regular expression to NFA is a fundamental problem that has been well studied. However, the two basic construction algorithms: (1) Thompson, (2) McNaughton-Yamada and Glushkov, both have disadvantages. In this paper: First, a "smart" parsing algorithm ..."
Abstract
- Add to MetaCart
. It is shown that the resulting NFA is minimized. This means that no auxiliary states can be eliminated without violating the defining properties of Thompson NFA. The time and space requirement for the above algorithms are linear with respect to the length of the regular expression. To the author's
Regularity of generalized sphere valued p-harmonic
, 2003
"... Abstract. We prove (see Theorem 1.3 below) that a generalized harmonic map into a round sphere, i.e. a map u ∈ W 1,1loc (, Sn−1) which solves the system div (ui∇uj − uj∇ui) = 0, i, j = 1,..., n, is smooth as soon as |∇u | ∈ Lq for any q> 1, and the norm of u in BMO is sufficiently small. Here, ..."
Abstract
- Add to MetaCart
decomposition and reverse Hölder inequalities. The results of this note belong to the regularity theory of nonlinear elliptic sys-tems with the right hand side growing critically with the gradient of solution. The particular system we have in mind may appear special but it is closely linked with vast parts
A New Query Processing Technique for XML Based on Signature
- Proceedings of the 7th International Conference on Database Systems for Advanced Applications (DASFAA '01), Hong Kong
, 2001
"... XML is represented as a tree and the query as a regular path expression. The query is evaluated by traversing each node of the tree. Several indexes are proposed for regular path expressions. In some cases these indexes may not cover all possible paths because of storage requirements. In this paper, ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
XML is represented as a tree and the query as a regular path expression. The query is evaluated by traversing each node of the tree. Several indexes are proposed for regular path expressions. In some cases these indexes may not cover all possible paths because of storage requirements. In this paper
Groups
"... with an automorphism of prime order that is almost regular in the sense of rank ..."
Abstract
- Add to MetaCart
with an automorphism of prime order that is almost regular in the sense of rank
Tree Automata Techniques and Applications - Chapter 3: Logic, Automata and Relations
, 1998
"... Contents Introduction 9 Preliminaries 13 1 Recognizable Tree Languages and Finite Tree Automata 17 1.1 Finite Tree Automata . . . . . . . . . . . . . . . . . . . . . . . . 18 1.2 The Pumping Lemma for Recognizable Tree Languages . . . . . 26 1.3 Closure Properties of Recognizable Tree Languages . . ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
. . . . . . . . . . . . . . . 52 2.2 Regular Expressions. Kleene's Theorem for
Expansions for Eisenstein integrals on semisimple symmetric spaces
- ARK. MAT
, 1996
"... ... In this paper we develop a theory of asymptotic (in fact, converging) expansions towards infinity for the Eisenstein integrals. The theory generalizes Harish-Chandra's theory (see [8], Thm. IV.5.5, and [13], Thm. 9.1.5.1) in the two cases mentioned above (see also [9], Thm. III.2.7). The ma ..."
Abstract
-
Cited by 17 (8 self)
- Add to MetaCart
... In this paper we develop a theory of asymptotic (in fact, converging) expansions towards infinity for the Eisenstein integrals. The theory generalizes Harish-Chandra's theory (see [8], Thm. IV.5.5, and [13], Thm. 9.1.5.1) in the two cases mentioned above (see also [9], Thm. III.2.7
1Multi-Frame Demosaicing and Super-Resolution of Color Images
"... In the last two decades, two related categories of problems have been studied independently in the image restoration literature: super-resolution and demosaicing. A closer look at these problems reveals the relation between them, and as conventional color digital cameras suffer from both low-spatial ..."
Abstract
- Add to MetaCart
interpolation along the edges and not across them. Simultaneously, Tikhonov regularization is used to smooth the chrominance components. Finally, an additional regularization term is used to force similar edge location and orientation in different color channels. We show that the minimization of the total cost
Results 1 - 10
of
187
