Filters








14 Hits in 2.2 sec

Page 1742 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
Vaclav Koubek (CZ-KARL; Prague) 95c:68068 68Q05 68R05 Delest, Maylis (F-BORD-LB; Talence); Dubernard, Jean-Philippe (F-POIT-LI; Poitiers) q-grammars: results, implementation.  ...  We present some results, along with a computer  ... 

Learning to Translate for Multilingual Question Answering

Ferhan Ture, Elizabeth Boschee
2016 Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing  
Acknowledgements Jacob Devlin has provided great help in the design and implementation of the context-based question translation approach.  ...  Averaging these three values results in the final weight of 0.23 in v q grammar in Figure 2 . Notice that these weights are normalized by construction.  ...  v q grammar :([(0.30( 0.23( 0.08( 0.09( …(]( s:( v s :([(2.0( (1.0( 1.0( (1.0( …(]( Table 2 : 2 L2T evaluated using MAP with 10-fold crossvalidation for each task.  ... 
doi:10.18653/v1/d16-1055 dblp:conf/emnlp/TureB16 fatcat:eja3yohw4zaj3obhl2mgmfovsq

Learning to Translate for Multilingual Question Answering [article]

Ferhan Ture, Elizabeth Boschee
2016 arXiv   pre-print
Acknowledgements Jacob Devlin has provided great help in the design and implementation of the context-based question translation approach.  ...  Averaging these three values results in the final weight of 0.23 in v q grammar in Figure 2 . Notice that these weights are normalized by construction.  ...  (v s ) Value LexCL v q word v s v q 10best v s cosine (v q , v s ) v q context v s v q grammar v s LexQL v q v s 1best Data Selection In order to train a machine learning model with our novel features  ... 
arXiv:1609.08210v1 fatcat:7rnfctatzbbytppuuxc5aizbdm

A verification framework for access control in dynamic web applications

Manar H. Alalfi, James R. Cordy, Thomas R. Dean
2009 Proceedings of the 2009 C3S2E conference on - C3S2E '09  
technology [13] , and to recover a sequence diagram from execution traces generated by the resulting instrumentation, Figure 1(A) .  ...  Broken access control is usually caused by an unreliable implementation of access control techniques.  ... 
doi:10.1145/1557626.1557643 dblp:conf/c3s2e/AlalfiCD09 fatcat:2vu6lcuq2zfdrihly6jiyg2dba

The early years of logic programming

Robert A. Kowalski
1988 Communications of the ACM  
Colmerauer saw how to improve the representation significantly, avoiding associativity by formalizing the graph representation of strings used in his Q-Grammars [5] .  ...  Colmerauer was not so readily satisfied with of association lists in the implementation of Lisp. By the purely theoretical results.  ... 
doi:10.1145/35043.35046 fatcat:uhppdqzhbfe45fschwndtqoso4

Tripartite Model of Fashion Design Process

Roger Ng
2017 Journal of Textile Engineering & Fashion Technology  
Together with those unused nodes, every nodes point to the ending node Q.  ...  Most importantly, such a tripartite model is suitable for the implementation of the computer with artificial intelligence when the mathematical definition is available.  ... 
doi:10.15406/jteft.2017.03.00106 fatcat:hbky3eaqp5ggvnnlndhpa7672e

Program size restrictions in computational learning

Sanjay Jain, Arun Sharma
1994 Theoretical Computer Science  
, for any q-grammar i for L, W$i,= L if i is the limiting value of g on any q-grammar for L; otherwise IVzci, is a finite set. ) begin {Definition of ConvProg(j, n)} {We first define two values m, and  ...  Hence, lim,,,g(i, n)=rl (mingrammar,(L)), which is a q-grammar for L. This proves one direction of the theorem. We now show that [Y'ETxtEx A YeTxtLSR]+$) [_YeTxtMinti].  ...  Analogs of Freivalds' results can be shown to hold for language learning also.  ... 
doi:10.1016/0304-3975(94)90047-7 fatcat:gkwmnsnixrfk3eb2jqu6f3fkuq

GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES

SERGIO GRECO, DOMENICO SACCÀ, CARLO ZANIOLO
1999 International Journal of Foundations of Computer Science  
The critical problem of finding efficient implementations for recursive queries with bound arguments offers many open challenges of practical and theoretical import.  ...  Preliminary experimental results obtained with this implementation are encouraging inasmuch as it appears that the pushdown method has better performance than classical methods, such as the magic set method  ...  Grammar Transformations to improve Pushdown In this section, we show that this kind of automaton becomes more effective when the grammar of the language has a particular structure.  ... 
doi:10.1142/s0129054199000253 fatcat:bea37siforcuzk66cnb5notoxq

Page 1425 of Mathematical Reviews Vol. 27, Issue Index [page]

Mathematical Reviews  
., 95e:68053 Delest, Maylis (with Dubernard, Jean-Philippe) q-grammars: results, implementation. (English summary) 95¢:68068 Dey, Tamal Krishna On counting triangulations in d dimensions.  ... 

The Methodology of the Social Sciences

E. N., Max Weber, Edward A. Shils, Henry A. Finch
1951 Journal of Philosophy  
Input grammar (Type I or 0) Arabic output or output * Q grammar??  ...  We have used the method of demisyllable formation of stem and prefix syllables with good results.  ... 
doi:10.2307/2020518 fatcat:d6ob2aeam5a3joz7c5tljiteey

The Methodology of the Social Sciences

1951 Journal of Philosophy  
Input grammar (Type I or 0) Arabic output or output * Q grammar??  ...  We have used the method of demisyllable formation of stem and prefix syllables with good results.  ... 
doi:10.5840/jphil19514812 fatcat:pbbkmojxsvbehety6hwo6hcrua

Processes and unfoldings: concurrent computations in adhesive categories

PAOLO BALDAN, ANDREA CORRADINI, TOBIAS HEINDEL, BARBARA KÖNIG, PAWEŁ SOBOCIŃSKI
2014 Mathematical Structures in Computer Science  
The main results show that processes are in one-to-one correspondence with switch-equivalent classes of derivations, and that the unfolding construction can be characterised as a coreflection, i.e., the  ...  Compared to previous work on the unfolding of Petri nets and graph grammars, our results apply to a wider class of systems, which is due to the use of a refined notion of grammar morphism. 2 concurrent  ...  Grammar morphisms can be seen as generalizations of the Petri net morphisms introduced in (Winskel, 1987a) .  ... 
doi:10.1017/s096012951200031x fatcat:umx7pscecfep7aozlehi72dsny

An Investigation of Grammar Design in Natural-Language Speech Recognition [chapter]

Yue Shi, Richard Frost
2004 Lecture Notes in Computer Science  
to implement and which have high perplexity and therefore low accuracy (Frost and Chitte, 1999) .  ...  Knight et al. (2001) implemented the preceding idea in the experiment o f a home device control system.  ...  Unfortunately, this approach has not been M ly implemented in a large application.  ... 
doi:10.1007/978-3-540-24840-8_61 fatcat:wfzhzfowxjgb3e362hx2vifmci

Subject Index Volumes 1–200

2001 Discrete Mathematics  
, 4494 q-enumeration, 4844, 4979 formula, 4977 of a species, 4844 q-exponential formula, 4983 function, 4000 q-Fibonacci number, 5373 q-Gauss summation, 4494 q-gon, 4901, see n-gon q-gonal face, 5820 q-grammar  ...  inequalities, 2475, 5360 system of orthogonal polynomials, 5789 p-numbers, 5958 q-numbers, 5958 of integers, 2111 system of simplices, 4971 subsets, 969, 1121 system without splits, 3541 systolic implementation  ...  matrix, 451, 609, 3298 unimodularity, 451, 1723 5683 unimodal, , 2222 5477 uniqueness, 1463, 1898, 2640, 2836, 3006, 3050, 3415, 3452, 3733, 3899, 3969, 4260, 4458, 4506, 5784, 5873 decomposition result  ... 
doi:10.1016/s0012-365x(00)00471-4 fatcat:znxg54q6ifgutnhzj3urcw455y