dblp.uni-trier.dewww.uni-trier.de

Caroline M. Eastman

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
42EEJonas Boustedt, Robert McCartney, Josh D. Tenenberg, Scott D. Anderson, Caroline M. Eastman, Daniel D. Garcia, Paul V. Gestwicki, Margaret S. Menzin: It seemed like a good idea at the time. SIGCSE 2008: 528-529
2006
41EEJohn B. Bowles, Caroline M. Eastman, Csilla Farkas: Engaging undergraduates in computer security research. InfoSecCD 2006: 184-190
2005
40EETyrone S. Toland, Csilla Farkas, Caroline M. Eastman: Dynamic Disclosure Monitor (D2Mon): An Improved Query Processing Solution. Secure Data Management 2005: 124-142
2003
39EEBernard J. Jansen, Caroline M. Eastman: The Effects of Search Engines and Query Operators on Top Ranked Results. ITCC 2003: 135-139
38EECaroline M. Eastman, Bernard J. Jansen: Coverage, relevance, and ranking: The impact of query operators on Web search engine results. ACM Trans. Inf. Syst. 21(4): 383-411 (2003)
2002
37EENancy J. Lightner, Caroline M. Eastman: User Preference for Product Information in Remote Purchase Environments. J. Electron. Commerce Res. 3(3): 174-186 (2002)
36 Caroline M. Eastman: 30, 000 hits may be better than 300: Precision anomalies in Internet searches. JASIST 53(11): 879-882 (2002)
2001
35 Csilla Farkas, Tyrone S. Toland, Caroline M. Eastman: The Inference Problem and Updates in Relational Databases. DBSec 2001: 181-194
1999
34EEFiona C. Coutinho, Caroline M. Eastman, Christopher B. Hare, Robert F. Skinder: Integrating Digital Resources into a Traditional University Research Library. ADL 1999: 88
33EECaroline M. Eastman: 30, 000 Hits may be Better than 300: Precision Anomalies in Internet Searches (poster abstract). SIGIR 1999: 313-314
32 Su Hee Kim, Caroline M. Eastman: An Experiment on Node Size in a Hypermedia System. JASIS 50(6): 530-536 (1999)
1998
31 April R. McQuire, Caroline M. Eastman: The Ambiguity of Negation in Natural Language Queries to Information Retrieval Systems. JASIS 49(8): 686-692 (1998)
1997
30 Royce Rose, Caroline M. Eastman: Hierarchical Classification as an Aid to Browsing. Informatica (Slovenia) 21(1): (1997)
1993
29 Yuk Fung Chang, Caroline M. Eastman: An Information Retrieval System for Reusable Software. Inf. Process. Manage. 29(5): 601-614 (1993)
1992
28EEAnamika Saxena, Su Hee Kim, Caroline M. Eastman: Node conversion in hypermedia systems. ACM Southeast Regional Conference 1992: 442-444
27 Caroline M. Eastman, Robert P. Trueblood: Occupancy Models for the Estimation of Block Accesses. Comput. J. 35(6): 654-658 (1992)
1991
26EECharlene W. Young, Caroline M. Eastman, Robert L. Oakman: An analysis of ill-formed input in natural language queries to document retrieval systems. Inf. Process. Manage. 27(6): 615-622 (1991)
25 Caroline M. Eastman: Formatted and unformatted character data types. JASIS 42(2): 110-111 (1991)
1990
24EECharlene W. Young, Caroline M. Eastman, Robert L. Oakman: An analysis of Ill-formed input in natural language queries. ACM Southeast Regional Conference 1990: 200
23 William F. Storer, Caroline M. Eastman: Some experiments in the use of clustering for data validation. Inf. Syst. 15(5): 537-542 (1990)
22 Ziad S. Nakkouzi, Caroline M. Eastman: Query formulation for handling negation in information retrieval systems. JASIS 41(3): 171-182 (1990)
1989
21 Walter D. Potter, Robert P. Trueblood, Caroline M. Eastman: Hyper-Semantic Data Modeling. Data Knowl. Eng. 4(1): 69-90 (1989)
20EECaroline M. Eastman: Approximate Retrieval: A Comparison of Information Retrieval and Database Management Systems. IEEE Data Eng. Bull. 12(2): 41-45 (1989)
19EECaroline M. Eastman: Handling incrementally specified boolean queries: A comparison of inverted and signature file organizations. Inf. Process. Manage. 25(1): 27-38 (1989)
18 Caroline M. Eastman: Research productivity and breadth of interest revisited. JASIS 40(5): 359-360 (1989)
1988
17EEIrene Yang, Caroline M. Eastman: Human autobiographic memory simulation. ACM Conference on Computer Science 1988: 738
16EECaroline M. Eastman: An approach to the evaluation of catalog selection systems. Inf. Process. Manage. 24(1): 23-30 (1988)
1987
15EECaroline M. Eastman: File Organizations and Incrementally Specified Queries. SIGIR 1987: 217-222
14 Caroline M. Eastman: Optimal bucket size for multiattribute retrieval in partitioned files. Inf. Syst. 12(4): 375-383 (1987)
13EECaroline M. Eastman: Introduction to fuzzy arithmetic: Theory and applications : Arnold Kaufmann and Madan M. Gupta, Van Nostrand Reinhold, New York, 1985. Int. J. Approx. Reasoning 1(1): 141-143 (1987)
12EECaroline M. Eastman: Introduction to fuzzy arithmetic: Theory and applications : Arnold Kaufmann and Madan M. Gupta, Van Nostrand Reinhold, New York, 1985. Int. J. Approx. Reasoning 1(1): 145-146 (1987)
11EECaroline M. Eastman: The First International Conference on Expert Database Systems: A Summary. SIGIR Forum 21(1-2): 6-10 (1987)
1985
10EECaroline M. Eastman: News from NSF. SIGIR Forum 18(2-4): 18-19 (1985)
1983
9EECaroline M. Eastman: Current Practice in The Evaluation of Multikey Search Algorithms. SIGIR 1983: 197-204
8 Caroline M. Eastman: A Lexical Analysis of Keywords in High Level Programming Languages. International Journal of Man-Machine Studies 19(6): 595-607 (1983)
1982
7 Caroline M. Eastman: A Comment on English Neologisms and Programming Language Keywords. Commun. ACM 25(12): 938-940 (1982)
6 Caroline M. Eastman, Maria Zemankova: Partially Specified Nearest Neighbor Searches Using k-d Trees. Inf. Process. Lett. 15(2): 53-56 (1982)
5 Caroline M. Eastman, Stephen F. Weiss: Tree structures for high dimensionality nearest neighbor searching. Inf. Syst. 7(2): 115-122 (1982)
1981
4EEWilliam F. Storer, Caroline M. Eastman: Experiments on the Application of Clustering Techniques to Data Validation (Abstract). SIGIR 1981: 88-89
3 Caroline M. Eastman: Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees. Inf. Process. Lett. 12(4): 165-167 (1981)
1980
2EEMaria Zemankova, Caroline M. Eastman: Comparative lexical analysis of FORTRAN code, code comments and English text. ACM Southeast Regional Conference 1980: 193-197
1978
1EECaroline M. Eastman, Stephen F. Weiss: A Tree Algorithm For Nearest Neighbor Searching In Document Retrieval Systems. SIGIR 1978: 131-149

Coauthor Index

1Scott D. Anderson [42]
2Jonas Boustedt [42]
3John B. Bowles [41]
4Yuk Fung Chang [29]
5Fiona C. Coutinho [34]
6Csilla Farkas [35] [40] [41]
7Daniel D. Garcia [42]
8Paul V. Gestwicki [42]
9Christopher B. Hare [34]
10Bernard J. Jansen [38] [39]
11Su Hee Kim [28] [32]
12Nancy J. Lightner [37]
13Robert McCartney [42]
14April R. McQuire [31]
15Margaret S. Menzin [42]
16Ziad S. Nakkouzi [22]
17Robert L. Oakman [24] [26]
18Walter D. Potter [21]
19Royce Rose [30]
20Anamika Saxena [28]
21Robert F. Skinder [34]
22William F. Storer [4] [23]
23Josh D. Tenenberg [42]
24Tyrone S. Toland [35] [40]
25Robert P. Trueblood [21] [27]
26Stephen F. Weiss [1] [5]
27Irene Yang [17]
28Charlene W. Young [24] [26]
29Maria Zemankova [2] [6]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)