Results 11 - 20 of 16,424

Table 3: Sample equivalent records from the Reasoning database L. P. Kaelbling. An architecture for intelligent reactive systems. In Reasoning About Actions and Plans: Proceedings of the 1986 Workshop. Morgan Kaufmann, 1986 Kaelbling, L. P., 1987. An architecture for intelligent reactive systems. In M. P. Georgeff amp; A. L. Lansky, eds., Reasoning about Actions and Plans, Morgan Kaufmann, Los Altos, CA, 395 410

in Learnable similarity functions and their applications to record linkage and clustering
by Mikhail Bilenko 2003
Cited by 3

Table 3: Sample equivalent records from the Reasoning database L. P. Kaelbling. An architecture for intelligent reactive systems. In Reasoning About Actions and Plans: Proceedings of the 1986 Workshop. Morgan Kaufmann, 1986 Kaelbling, L. P., 1987. An architecture for intelligent reactive systems. In M. P. Georgeff amp; A. L. Lansky, eds., Reasoning about Actions and Plans, Morgan Kaufmann, Los Altos, CA, 395 410

in Learnable similarity functions and their applications to record linkage and clustering. Doctoral Dissertation Proposal
by Mikhail Bilenko 2003
Cited by 3

Table 3: Sample duplicate records from the Reasoning database L. P. Kaelbling. An architecture for intelligent reactive systems. In Reasoning About Actions and Plans: Proceedings of the 1986 Workshop. Morgan Kaufmann, 1986 Kaelbling, L. P., 1987. An architecture for intelligent reactive systems. In M. P. Georgeff amp; A. L. Lansky, eds., Reasoning about Actions and Plans, Morgan Kaufmann, Los Altos, CA, 395 410

in Adaptive Duplicate Detection Using Learnable String Similarity Measures
by unknown authors

Table 3: Sample duplicate records from the Reasoning database L. P. Kaelbling. An architecture for intelligent reactive systems. In Reasoning About Actions and Plans: Proceedings of the 1986 Workshop. Morgan Kaufmann, 1986 Kaelbling, L. P., 1987. An architecture for intelligent reactive systems. In M. P. Georgeff amp; A. L. Lansky, eds., Reasoning about Actions and Plans, Morgan Kaufmann, Los Altos, CA, 395 410

in Mikhail Bilenko and Raymond J. MooneyDepartment of Computer Sciences
by unknown authors

Table 1: Numbers of gures or pictures in articles of the Proceedings IEEE Vi- sualization and ACM SIGGRAPH. On the average, each article contains about eight gures.

in A Picture-based Document Retrieval Service for the Electronic Visualization Library
by Ingmar Decker 1998
Cited by 1

Table 5. Most cited Journals in ER papers up to 1999. Journal Title # Cites ACM Transactions on Database Systems 886 Communications of the ACM 278

in unknown title
by unknown authors
"... In PAGE 4: ... Source names in Table 4 follow the journal abbreviations used by the Web of Science. See Table5 for a list of the most popular ones. Table 4 is predominated by journal papers, except the two ER papers by Scheuermann and Santos.... In PAGE 4: ... Table 4 is predominated by journal papers, except the two ER papers by Scheuermann and Santos. Table5 lists most frequently cited journals in ER papers between 1979 and 1999. Table 1.... ..."

Table 1. Statistics for GD, ACM [8], and NCSTRL [17].

in GraphAEL: Graph Animations with Evolving Layouts
by C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, G. Yee 2003
"... In PAGE 11: ...4 Statistical of the Graph Drawing Literature We compared the data from the GD database, with the data from two computer science databases, the ACM database [8] and the NCSTRL database [17]. Table1 shows a summary of the overall statistics and they are examined in the detail in the appendix. References 1.... ..."
Cited by 19

Table 2: Compression evaluation using les in the Canterbury corpus (Large Set) The original le size (with some pre xes), compressed le size by gzip and compress, and the improvement (%) made by LZW-FP, FPA, and FPA-24 over gzip and compress [FM95] M. Farach and S. Muthukrishnan. Optimal parallel dictionary matching and compression. In ACM Symposium on Parallel Algorithms and Architectures, 1995. [FNS+95] M. Farach, M. Noordeweir, S. Savari, L. Shepp, A. J. Wyner, and J. Ziv. The entropy of DNA: Al- gorithms and measurements based on memory and rapid convergence. In ACM-SIAM Symposium on Discrete Algorithms, 1995.

in Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression
by Extended, Yossi Matias, Nasir Rajpoot, Suleyman Cenk S Ahinalp 1998
Cited by 2

Table 6. Basic statistic measures extracted from LNCS proceedings.

in A Statistic Study for the ADBIS Period 1994-2006
by Yannis Manolopoulos
"... In PAGE 8: ...igure 2. Statistical distribution of the number of papers per author. We have accumulated the statistics about authors to come up with statistics about the countries of origin of the accepted papers. The number of countries per year is known from Table6... In PAGE 11: ...e. 31 papers divided by 254, the sum the 4th column of Table6 ). 1998 1999 2000 2001 2002 2003 2004 2005 2006 Ita-Pol Fin-Ukr Gre-USA Fra-Rus Ire-Pol Hun-Ger Cze-Ger Net-UK Rus-Sin Pol- USA India- USA Bel-Ger- Isr Austra- Jap Gree- Spa NZea- Ger Fin-Ire- UK Cyp- USA Austri- Swi Spa- USA Ger-USA Cze- Slova Gre- USA SAra- USA Fra-Swi Ger- USA Ger-Hun Gre-Spa Gre-Pol Gre- Spa Gre-Spa Sin-USA Table 11.... ..."

Table 1: Traditional vs. Partial Inlining: Amount of Inlining Achieved [7] K. D. Cooper, M. W. Hall, and L. Torczon, \Unexpected Side E ects of Inline Substitution quot;, ACM Letters on Programming Languages and Systems vol. 1 no. 1, March 1992, pp. 22{32. [8] J. W. Davidson and A. M. Holler, \Subprogram Inlining: A Study of its E ects on Program Execution Time quot;, IEEE Transactions on Software Engineering vol. 18 no. 2, Feb. 1992, pp. 89{102. [9] K. De Bosschere and S. K. Debray, \alto : A Link-Time Optimizer for the DEC Alpha quot;, Technical Report 96-15, Dept. of Computer Science, The University of Arizona, June 1996. [10] J. Dean and C. Chambers, \Towards Better Inlining Decisions using Inlining Trials quot;, Proc. 1994 ACM Conference on Lisp and Functional Programming, Orlando, Florida, June 1994, pp. 273{282. [11] R. E. Hank, Region-based Compilation, Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1996. [12] R. E. Hank, W. W. Hwu, and B. R. Rau, \Region-Based Compilation: An Introduction and Motivation quot;, Proc. 28th IEEE/ACM Symposium on Microarchitecture, Nov. 1995, pp. 158{168. 11

in Partial Inlining
by Robert Muth, Saumya Debray
"... In PAGE 9: ... Partial inlining can be compared to traditional inlining along two dimensions: rst, the amount of inlining that can be achieved for a given \budget quot; of code growth; and second, the improvement in execution time. Table1 illustrates the rst dimension using three di erent budgets (a code growth factor of m% in this table indicates that each function is allowed to increase in size by at most m%). Three groups of data are shown for each benchmark program: the number of call sites expanded inline; the total number of basic blocks inlined across all of the call sites expanded; and the total number of instructions in these basic blocks.... ..."
Results 11 - 20 of 16,424