• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 12,373
Next 10 →

Table 3: Accuracy results for binary decisions.

in Modelling Polysemy in Adjective Classes by Multi-Label Classification Gemma Boleda
by unknown authors
"... In PAGE 5: ... The second best results were obtained with level morph. These results could have been expected from the results obtained by the individual decisions ( Table3 ); however, note that the differences between the various levels are much clearer in the combined classification than in the individual binary decisions. Table 5 shows the two-by-two comparisons of the accuracy scores.... ..."

Table 2: Contingency table for a set of binary decisions

in Text categorization using character shape codes
by A. Lawrence Spitz, Arman Maghbouleh 1999
Cited by 3

Table 1 Summary of Binary Design Decisions

in Layered, Multi-Threaded, High-Level Performance Design
by unknown authors
"... In PAGE 5: ... We measured the average speed-up over the header match lengths for both the MESH and ISS models. Table 1 summarizes the average and maximum error for the MESH with respect to the ISS model for nine design modifications (the first and last columns of Table1 are discussed later). Of the nine experiments, seven have average percent error less than 5%, and seven have maximum percent error less than 5%.... In PAGE 6: ... This shows an increased performance at each match length predicted by both models. Table1 summarizes all nine design modifications according to whether the modification can be evaluated correctly in terms of performance improvement or degradation. The design change index is the modification as listed in section 3.... In PAGE 6: ... a design change step for both MESH (yellow) and ISS (blue). Adding the third microengine initially produces a performance degradation (also shown in Table1 ). However, in combination with other changes, such as increasing the number of memory arbiters, a performance improvement is seen.... ..."

Table 2.2: Binary decisions (bins) assigned for DC DCT coefficients

in An Arithmetic Entropy Codec VLSI chip for JPEG image compression
by Georgios A. Dimitriadis

Table 2.3: Binary decisions (bins) assigned for AC DCT coefficients

in An Arithmetic Entropy Codec VLSI chip for JPEG image compression
by Georgios A. Dimitriadis

Table 6: This table lists the CDTI alert decisions for the Binary and Likelihood Alerts.

in Cockpit Display of Traffic Information Automated Conflict Alerting: Parameters to Maximize Effectiveness and Minimize Disruption in Multi-Task Environments
by Angela Colcombe, Christopher D. Wickens 2006
"... In PAGE 28: ... The alarm threshold for Experiment 2 resulted in a ratio of false alarms to misses of 4:1 while the reliability of the system remained essentially the same as it was in Experiment 1. The categorization of collisions and automated decisions is outlined in Table6 for both the binary and likelihood alerts. Table 6: This table lists the CDTI alert decisions for the Binary and Likelihood Alerts.... ..."

Table 3.1: Illustration of Binary to Real Conversion Decision Variable

in Nonlinear Optimization Of Well Production Considering Gas Lift And Phase Behavior
by A Report, Palke, Roland N. Horne

Table 1: Performance of a discourse segmenter that uses a decision-tree, non-binary classifier.

in A Decision-Based Approach to Rhetorical Parsing
by Daniel Marcu 1999
Cited by 22

Table 2 shows the number of cycles of target enlargement that was possible with each of the designs within 200 Mbytes of memory. While the size of the Binary Decision Diagrams(BDDs) is not very large, computing the next larger preimage for all the examples except Inbox, MC1, and MC2 (Small), exceeded the memory limit [1].

in Validation with Guided Search of the State Space
by C. Han Yang, David L. Dill 1998
"... In PAGE 2: ... Table2 Target Enlargement Table 3 shows the number of visited states and explored states. The number of visited states includes those that eventually became explored states.... ..."
Cited by 58

Table 1: The complexity of FCSPs Problem Restriction Sequential Complexity Parallel Complexity FCSP decision binary relations NP-complete

in Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments
by Ying Zhang, Alan K. Mackworth
"... In PAGE 5: ... In addition to the theoretical results, we have simulated the ne-grain distributed algorithm based on logical time assumptions and experimented with the coarse-grain distributed algo- rithm on a network of transputers. Table1 summarizes current knowledge on the complexity of FCSPs; our results are marked with (y). The rest of the paper is organized as follows.... ..."
Next 10 →
Results 1 - 10 of 12,373
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University