- CSB - MetaPress - Google - Bing - Yahoo
 | 1997 | |
|---|---|---|
| c8 |      | Ulrich Pfeifer, Stefan Pennekamp: Incremental Processing of Vague Queries in Interactive Retrieval Systems. HIM 1997: 223-235 |
| 1996 | ||
| j4 |  | Ulrich Pfeifer, Thomas Poersch, Norbert Fuhr: Retrieval Effectiveness of Proper Name Search Methods. Inf. Process. Manage. 32(6): 667-679 (1996) |
| 1995 | ||
| j3 | | Ulrich Pfeifer, Norbert Fuhr, Tung Huynh: Searching Structured Documents with the Enhanced Retrieval Functionality of freeWAIS-sf and SFgate. Computer Networks and ISDN Systems 27(6): 1027-1036 (1995) |
| c7 | | Ulrich Pfeifer, Thomas Poersch, Norbert Fuhr: Searching Proper Names in Databases. HIM 1995: 259-275 |
| c6 | | Ulrich Pfeifer, Norbert Fuhr: Efficient Processing of Vague Queries using a Data Stream Approach. SIGIR 1995: 189-197 |
| 1994 | ||
| j2 | | Norbert Fuhr, Ulrich Pfeifer: Probabilistic Information Retrieval as a Combination of Abstraction, Inductive Learning, and Probabilistic Assumptions. ACM Trans. Inf. Syst. 12(1): 92-115 (1994) |
| 1993 | ||
| j1 | | |
| c5 | | Ulrich Pfeifer, Norbert Fuhr: Aufwandsabschätzung für die Prozessierung vager Anfragen auf der Basis des Datenstrom-Ansatzes. BTW 1993: 375-392 |
| c4 | | Michael Schmidt, Ulrich Pfeifer: Eignung von Signaturbäumen für Best-Match-Anfragen. Information Retrieval 1993: 125-138 |
| c3 | | Norbert Fuhr, Ulrich Pfeifer, C. Bremkamp, Michael Pollmann: Probalistic Learning Approaches for Indexing and Retrieval with the TREC-2 Collection. TREC 1993: 67-74 |
| 1991 | ||
| c2 | | Ulrich Pfeifer: Entwicklung linear-iterativer und logistischer Indexierungsfunktionen. Information Retrieval 1991: 38-50 |
| c1 | | Norbert Fuhr, Ulrich Pfeifer: Combining Model-Oriented and Description-Oriented Approaches for Probabilistic Indexing. SIGIR 1991: 46-56 |
| 1 | C. Bremkamp | |
| 2 | Norbert Fuhr | |
| 3 | Tung Huynh | |
| 4 | Stefan Pennekamp | |
| 5 | Thomas Poersch | |
| 6 | Michael Pollmann | |
| 7 | Michael Schmidt |
Data released under the ODC-BY 1.0 license — See also our legal information page