Learn More
A graph model is presented to analyze the performance of a relational join. The amount of page reaccesses, the page access sequence, and the amount of buffer needed are represented in terms of graph parameters. By using the graph model formed from the index on the join attributes, we determine the relationships between these parameters. Two types of buffer(More)
23 and that two defects (blurring and thresholding) aaect classiication accuracy signiicantly, continuously, and monotonically. We believe that these results, as well as the methodology, can be further exploited to guide the training of individual classiiers and coordination of multiple classiiers. We have focused our attention on methodologies for making(More)
BACKGROUND Prevention programmes should only be recommended if they achieve what they promise to achieve. Therefore, we checked the variation and validity of recommendations for screening for colorectal cancer of nine organisations. METHODS We analysed the information concerning recommended screening age, guaiac faecal occult blood test (gFOBT), faecal(More)
17 a similar reason, we did not nd the method of projection pursuit 5] in exploratory data analysis useful in this context. 4 Conclusions We described a method for inferring from the training data faithful but concise representations of the empirical class-conditional distributions. In doing this, we have abandoned many usual simplifying assumptions about(More)
We have investigated a new methodology for studying recognition problems | rst we construct a realistic generative model, then we empirically study the resulting distributions to estimate tradeoos between computational requirements and the probability of error. Our experiments show that such simulations can provide a rich source of statistics to guide(More)
  • 1