David A. Evans 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Peter Jansen 0002

> Home > Persons > David A. Evans 0001

Publications

2000
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/sigir/ZhaiJE00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigir/ZhaiJE00
ChengXiang Zhai, Peter Jansen, David A. Evans:
Exploration of a heuristic approach to threshold learning in adaptive filtering. SIGIR 2000: 360-362
1999
[c16]
- view
  - electronic edition @ nist.gov (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/trec/ZhaiJRSE99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trec/ZhaiJRSE99
ChengXiang Zhai, Peter Jansen, Norbert Roma, Emilia Stoica, David A. Evans:
Optimization in CLARIT TREC-8 Adaptive Filtering. TREC 1999
1998
[c15]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/trec/EvansHTJB98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trec/EvansHTJB98
David A. Evans, Alison Huettner, Xiang Tong, Peter Jansen, Jeffrey Bennett:
Effectiveness of Clustering in Ad-Hoc Retrieval. TREC 1998: 90-95
[c14]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/trec/ZhaiJSGE98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trec/ZhaiJSGE98
ChengXiang Zhai, Peter Jansen, Emilia Stoica, Norbert Grot, David A. Evans:
Threshold Calibration in CLARIT Adaptive Filtering. TREC 1998: 96-103

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.