Results 1 - 10 of 7,256

Table 1: Inference permutability in MALL2

in A PSPACE-complete fragment of Second Order Linear Logic
by G. Perrier, Loria Universit'e Nancy
"... In PAGE 4: ... The results that conclude this study can be easily transposed to second order linear logic. Here, we are only interested in the fragment MALL2 for which inference permutabil- ity can be summarised in Table1 . There are eight cases of non permutability cor- responding to the eight entries of the table that are marked by np 1.... ..."

Table 5: E ect of Constituent Veri cation (P = precision; R = recall) Data Set No Constituent Constituent Veri cation Using Veri cation C4.5 K-NN K-NN+VDM Simple Base NP .920P/.932R .922P/.925R .920P/.931R .928P/.919R Complex Base NP

in Combining Error-Driven Pruning and Classification for Partial Parsing
by Claire Cardie, Scott Mardis, David Pierce 1999
"... In PAGE 7: ...oth linguistic tasks is skewed w.r.t. class distribution, and no attempt was made to balance the data sets for the experiments reported here. 6 Combining Pruning and Constituent Veri cation Table5 shows the e ect of constituent veri cation on base NP and verb-object identi cation. For these ex- periments, the learning algorithms for constituent ver- i cation were trained on 1000 cases derived from the associated pruning corpus.... ..."
Cited by 7

Table 1.1 Summary of NP- and #P-hardness results for planar instances. The third column summarizes the decision complexity of the problems while the fourth column summarizes the complexity of the counting versions. A star (*) denotes a result obtained in this paper. The numbers in square brackets are the references where the corresponding results are proved.

in unknown title
by unknown authors

Table 1. Rate of the size of log

in Accommodating Logical Logging under Fuzzy Checkpointing in Main Memory Databases
by Seungkyoon Woo, Myoung Ho Kim, Kim Yoon, Joon Lee 1997
Cited by 2

Table for Ex

in SOFTWARE FOR SIMULATION OF PRINTED CIRCUIT
by Board (pcb Assembly, F. Kung, H. T. Chuah

Table 1 gives the list of allowed character names together with their ASCII equivalent ex- pressed in octal.

in STk Reference Manual -- Version 4.0
by Erick Gallesio
"... In PAGE 18: ...STk Reference Manual name value alternate name name value alternate name nul 000 null bs 010 backspace soh 001 ht 011 tab stx 002 nl 012 newline etx 003 vt 013 eot 004 np 014 page enq 005 cr 015 return ack 006 so 016 bel 007 bell si 017 dle 020 can 030 dc1 021 em 031 dc2 022 sub 032 dc3 023 esc 033 escape dc4 024 fs 034 nak 025 gs 035 syn 026 rs 036 etb 027 us 037 sp 040 space del 177 delete Table1 : Valid character names Sequence Character inserted \b Backspace \e Escape \n Newline \t Horizontal Tab \n Carriage Return \0abc ASCII character with octal value abc \ lt;newline gt; None (permits to enter a string on several lines) \ lt;other gt; lt;other gt; Table 2: String escape sequences 6.7 Strings STk string constants allow the insertion of arbitrary characters by encoding them as escape sequences, introduced by a backslash (\).... ..."

Table 7. Menu items (number of senses and syntactic roles)

in Ambiguity Identification and Measurement in Natural Language Texts
by Mariano Ceccato, Nadzeya Kiyavitskaya, Nicola Zeni, Luisa Mich, Daniel M. Berry

Table 7. Parameters for some NP and m-NP test.

in Close-point spatial tests and their application to random number generators
by Jean-françois Cordeau, Richard Simard 1997
"... In PAGE 7: ... Table7 gives a list of test parameters for the NP and m-NP tests in the unit torus. Table 8 gives another set for the Bickel-Breiman test.... ..."
Cited by 8

Table 1. Performance evaluation #28NP - Network Partitioning failure, T NP

in Dealing with Network Partitioning: a Case Study
by Wanlei Zhou, Weijia Jia 1999
"... In PAGE 11: ... All transactions were designed to be able to execute successfully and therefore no ful#0Cllment transactions were generated. Table1 lists our test results. The table shows the average response time for each cases.... In PAGE 11: ...Table 1. Performance evaluation #28NP - Network Partitioning failure, T NP : Time du- ration of the network partitioning failure#29 Table1 shows that, for a primary transaction T p , a network partitioning failure does not a#0Bect the response time #28considering up to 5#25 standard devia- tions, the two times are the same#29. This is because that the commit result for T p is returned immediately after the execution of the transaction, no matter if a network partitioning failure occurs or not.... ..."
Cited by 2

Table 2: Median of MSE Method Ex.1 Ex.2 Ex.3 Ex.4

in Regression Shrinkage and Selection via the Elastic Net, With . . .
by Hui Zou, Trevor Hastie 2003
"... In PAGE 16: ... OLS performs much worse than ridge and the lasso in all four examples, so we do not show its results. Table2 and Figure 4 (Box-plots) summarize the prediction accuracy comparison results. Table 3 shows the variable se- lection results.... ..."
Cited by 3
Results 1 - 10 of 7,256