1 |
ulpfr |
10 |
CK: Fuhr/Pfeifer:91 |
2 |
|
|
DT: IP |
3 |
|
|
AU: Fuhr, N.; Pfeifer, U. |
4 |
|
|
TI: Combining Model-Oriented and Description-Oriented Approaches for |
5 |
|
|
Probabilistic Indexing |
6 |
|
|
ER: Bookstein, A.; Chiaramella, Y.; Salton, G.; Raghavan, V.V. |
7 |
|
|
BT: Proceedings of the Fourteenth Annual International ACM/SIGIR |
8 |
|
|
Conference on Research and Development in Information Retrieval |
9 |
|
|
PN: ACM |
10 |
|
|
PA: New York |
11 |
|
|
PP: 46-56 |
12 |
|
|
LA: EN |
13 |
|
|
ED: 28.10.91 |
14 |
|
|
PY: 1991 |
15 |
|
|
LO: P |
16 |
|
|
RD: Fu |
17 |
|
|
CC: H.3.3; H.99.3 |
18 |
|
|
SD: retrieval models |
19 |
|
|
FT: probabilistic retrieval |
20 |
|
|
|
21 |
|
|
CK: Fuhr/Pfeifer:94 |
22 |
|
|
DT: AR |
23 |
|
|
AU: Fuhr, N.; Pfeifer, U. |
24 |
|
|
TI: Probabilistic Information Retrieval as Combination of Abstraction, |
25 |
|
|
Inductive Learning and Probabilistic Assumptions |
26 |
|
|
JT: TOIS |
27 |
|
|
VO: 12 |
28 |
|
|
NO: 1 |
29 |
|
|
PP: 92-115 |
30 |
|
|
LA: EN |
31 |
|
|
ED: 04.01.93 |
32 |
|
|
PY: 1994 |
33 |
|
|
LO: D |
34 |
|
|
RD: Fu |
35 |
|
|
CC: H.3.3; H.99.3 |
36 |
|
|
SD: retrieval models |
37 |
|
|
FT: probabilistic retrieval |
38 |
|
|
|
39 |
|
|
CK: Pfeifer:91 |
40 |
|
|
DT: IP |
41 |
|
|
AU: Pfeifer, U. |
42 |
|
|
TI: Entwicklung linear iterativer und logistischer |
43 |
|
|
Indexierungsfunktionen |
44 |
|
|
ER: Fuhr, N. |
45 |
|
|
BT: Information Retrieval |
46 |
|
|
PN: Springer |
47 |
|
|
PA: Berlin et al. |
48 |
|
|
PP: 23-37 |
49 |
|
|
LA: GE |
50 |
|
|
ED: 02.07.91 |
51 |
|
|
PY: 1991 |
52 |
|
|
RD: Pf |
53 |
|
|
GT: experimentation |
54 |
|
|
CC: H.3.1; G.1.2 |
55 |
|
|
SD: least squares approximation; indexing methods |
56 |
|
|
FT: logistic functions; indexing functions; DIA |
57 |
|
|
|
58 |
|
|
CK: Fuhr/etal:94 |
59 |
|
|
DT: IP |
60 |
|
|
CR: TREC-2 |
61 |
|
|
AU: Fuhr, N.; Pfeifer, U.; Bremkamp, C.; Pollmann, M.; Buckley, C. |
62 |
|
|
TI: Probabilistic Learning Approaches for Indexing and Retrieval |
63 |
|
|
with the TREC-2 Collection |
64 |
|
|
LA: EN |
65 |
|
|
ED: 02.12.93 |
66 |
|
|
PY: 1994 |
67 |
|
|
PR: TOAPP |
68 |
|
|
LO: D |
69 |
|
|
RD: Fu |
70 |
|
|
CC: G.1.2; H.3.1; H.3.3; H.99.3 |
71 |
|
|
SD: least squares approximation; indexing methods; retrieval models |
72 |
|
|
FT: probabilistic models; query expansion |
73 |
|
|
PP: 67-74 |
74 |
|
|
|
75 |
|
|
CK: Pfeifer/etal:94 |
76 |
|
|
DT: MC |
77 |
|
|
AU: Pfeifer, U.; Pennekamp, S.; Fuhr, N. |
78 |
|
|
TI: Incremental Processing of Vague Queries in Interactive Retrieval Systems |
79 |
|
|
ED: 10.01.94 |
80 |
|
|
PY: 1994 |
81 |
|
|
PR: SUBMITTED |
82 |
|
|
LO: D |
83 |
|
|
RD: Fu |
84 |
|
|
CC: H.3.2 |
85 |
|
|
SD: file organization |
86 |
|
|
|
87 |
|
|
CK: Poersch/Pfeifer:94 |
88 |
|
|
DT: MC |
89 |
|
|
AU: Poersch, T.; Pfeifer, U. |
90 |
|
|
TI: Similarity Measures for Strings |
91 |
|
|
LA: EN |
92 |
|
|
ED: 10.01.94 |
93 |
|
|
PY: 1994 |
94 |
|
|
PR: SUBMITTED |
95 |
|
|
LO: D |
96 |
|
|
RD: Fu |
97 |
|
|
CC: H.99.3 |
98 |
|
|
|
99 |
|
|
CK: Pfeifer/etal:95 |
100 |
|
|
DT: IP |
101 |
|
|
AU: Pfeifer, U.; Fuhr, N.; Huynh, T. |
102 |
|
|
TI: Searching Structured Documents with the Enhanced Retrieval |
103 |
|
|
Functionality of freeWAIS-sf and SFgate |
104 |
|
|
ER: D. Kroemker |
105 |
|
|
BT: Computer Networks and ISDN Systems; Proceedings of the third |
106 |
|
|
International World-Wide Web Conference |
107 |
|
|
PN: Elsevier |
108 |
|
|
PA: Amsterdam - Lausanne - New York - Oxford - Shannon - Tokyo |
109 |
|
|
PP: 1027-1036 |
110 |
|
|
LA: EN |
111 |
|
|
ED: 03.02.95 |
112 |
|
|
PY: 1995 |
113 |
|
|
PM: APR |
114 |
|
|
PR: Available in electronic form from |
115 |
|
|
http://www.igd.fhg.de/www/www95/papers/47/fwsf/fwsf.html and |
116 |
|
|
http://www.elsevier.nl (passwd els4www3) |
117 |
|
|
LO: P |
118 |
|
|
RD: Pf |
119 |
|
|
CC: H.2.3; H.3.2 |
120 |
|
|
SD: Query languages |
121 |
|
|
FT: WAIS, Form, User-Interface, Query Language, Retrieval, Search, |
122 |
|
|
Multi-Server Search, Network Information Retrieval |
123 |
|
|
AB: The original WAIS implementation by Thinking Machines et |
124 |
|
|
al. treats documents as uniform bags of terms. Since most |
125 |
|
|
documents exhibit some internal structure, it is desirable to |
126 |
|
|
provide the user means to exploit this structure in his |
127 |
|
|
queries. ... |
128 |
|
|
|
129 |
|
|
CK: Pfeifer/etal:95a |
130 |
|
|
DT: IP |
131 |
|
|
CR: HIM:95 |
132 |
|
|
AU: Pfeifer, U; Poersch, T; Fuhr, N. |
133 |
|
|
TI: Searching Proper Names in Databases |
134 |
|
|
PP: 259-276 |
135 |
|
|
LA: EN |
136 |
|
|
ED: 03.02.95 |
137 |
|
|
PY: 1995 |
138 |
|
|
LO: P |
139 |
|
|
RD: tha |
140 |
|
|
|
141 |
|
|
CK: Pfeifer/Fuhr:95 |
142 |
|
|
DT: IP |
143 |
|
|
AU: Pfeifer, U.; Fuhr, N. |
144 |
|
|
TI: Efficient Processing of Vague Queries using a Data Stream Approach |
145 |
|
|
BT: Proceedings of the 18th International {ACM SIGIR} Conference on |
146 |
|
|
Research and Development in Information Retrieval |
147 |
|
|
PN: ACM |
148 |
|
|
PA: New York |
149 |
|
|
PP: 189-198 |
150 |
|
|
LA: EN |
151 |
|
|
ED: 10.03.95 |
152 |
|
|
PY: 1995 |
153 |
|
|
CN: (to appear) |
154 |
|
|
LO: P |
155 |
|
|
RD: Pf |
156 |
|
|
CC: H.2.4; H.3.3; H.99.4 |
157 |
|
|
SD: query processing; selection process |
158 |
|
|
FT: stream-oriented |
159 |
|
|
|
160 |
|
|
CK: Pfeifer:90 |
161 |
|
|
DT: TR |
162 |
|
|
RT: DPA |
163 |
|
|
AU: Pfeifer, U. |
164 |
|
|
TI: Development of Log-Linear and Linear-Iterative Indexing Functions |
165 |
|
|
(in German) |
166 |
|
|
PI: DVS2 |
167 |
|
|
LA: GE |
168 |
|
|
ED: 09.01.90 |
169 |
|
|
PY: 1990 |
170 |
|
|
LO: D |
171 |
|
|
RD: Fu |
172 |
|
|
CC: I.5.1; I.2.6; G.1.2; H.3.1 |
173 |
|
|
SD: statistical models; parameter learning; least squares |
174 |
|
|
approximation; nonlinear approximation; Indexing methods |
175 |
|
|
FT: DIA; logistic regression; maximum likelihood estimation |
176 |
|
|
|
177 |
|
|
CK: Burghardt/etal:93 |
178 |
|
|
DT: IP |
179 |
|
|
AU: Burghardt, A.; Fuhr, N.; Großjohann, K.; Pfeifer, U.; |
180 |
|
|
Spielmann, H.; Stach, O. |
181 |
|
|
TI: NOSFERATU --- ein integriertes Datenbank- und |
182 |
|
|
Informationssystem basierend auf dem Datenstrom-Paradigma |
183 |
|
|
BT: Proceedings 1. GI-Fachtagung Information Retrieval |
184 |
|
|
PN: Universitätsverlag Konstanz |
185 |
|
|
PA: Konstanz |
186 |
|
|
PP: 27-40 |
187 |
|
|
LA: GE |
188 |
|
|
ED: 04.01.93 |
189 |
|
|
PY: 1993 |
190 |
|
|
LO: P |
191 |
|
|
RD: Fu |
192 |
|
|
CC: H.3.3 |
193 |
|
|
SD: selection process |
194 |
|
|
FT: stream-oriented |
195 |
|
|
|
196 |
|
|
CK: Burghardt/etal:93a |
197 |
|
|
DT: IP |
198 |
|
|
AU: Burghardt, A.; Fuhr, N.; Großjohann, K.; Pfeifer, U.; |
199 |
|
|
Spielmann, H.; Stach, O. |
200 |
|
|
TI: NOSFERATU --- an Integrated Database Management and Information |
201 |
|
|
Retrieval system based on Data Streams (in German) |
202 |
|
|
BT: Proceedings 1. GI-Fachtagung Information Retrieval |
203 |
|
|
PN: Universitätsverlag Konstanz |
204 |
|
|
PA: Konstanz |
205 |
|
|
PP: 27-40 |
206 |
|
|
LA: GE |
207 |
|
|
ED: 04.01.93 |
208 |
|
|
PY: 1993 |
209 |
|
|
LO: P |
210 |
|
|
RD: Fu |
211 |
|
|
CC: H.3.3 |
212 |
|
|
SD: selection process |
213 |
|
|
FT: stream-oriented |
214 |
|
|
|
215 |
|
|
CK: Pfeifer/Fuhr:93 |
216 |
|
|
DT: IP |
217 |
|
|
AU: Pfeifer, U.; Fuhr, N. |
218 |
|
|
TI: Aufwandsabschätzung für die Prozessierung vager Anfragen auf der |
219 |
|
|
Basis des Datenstrom-Ansatzes |
220 |
|
|
ER: Stucky, W. |
221 |
|
|
BT: Datenbanksysteme in Büro, Technik und Wissenschaft |
222 |
|
|
PN: Springer |
223 |
|
|
PA: Berlin et al. |
224 |
|
|
PP: 375-392 |
225 |
|
|
LA: GE |
226 |
|
|
ED: 17.12.92 |
227 |
|
|
PY: 1993 |
228 |
|
|
LO: P |
229 |
|
|
RD: Pf |
230 |
|
|
CC: H.2.4; H.3.3; H.99.4 |
231 |
|
|
SD: query processing; selection process |
232 |
|
|
FT: stream-oriented |
233 |
|
|
|
234 |
|
|
CK: Schmidt/Pfeifer:93 |
235 |
|
|
DT: IP |
236 |
|
|
AU: Schmidt, M.; Pfeifer, U. |
237 |
|
|
TI: Eignung von Signaturbäumen für Best-Match-Anfragen |
238 |
|
|
BT: Proceedings 1. GI-Fachtagung Information Retrieval |
239 |
|
|
PN: Universitätsverlag Konstanz |
240 |
|
|
PA: Konstanz |
241 |
|
|
PP: 125-138 |
242 |
|
|
LA: GE |
243 |
|
|
PY: 1993 |
244 |
|
|
PR: TOAPP |
245 |
|
|
LO: D |
246 |
|
|
RD: Pf |
247 |
|
|
CC: H.3.2 |
248 |
|
|
SD: file organisation |
249 |
|
|
FT: signature files; signature trees |
250 |
|
|
ED: 24.06.93 |
251 |
|
|
|
252 |
|
|
CK: Schmidt/Pfeifer:93a |
253 |
|
|
DT: IP |
254 |
|
|
AU: Schmidt, M.; Pfeifer, U. |
255 |
|
|
TI: Suitability of Signature Trees for Processing of Best Match |
256 |
|
|
Queries (in German) |
257 |
|
|
BT: Proceedings 1. GI-Fachtagung Information Retrieval |
258 |
|
|
PN: Universitätsverlag Konstanz |
259 |
|
|
PA: Konstanz |
260 |
|
|
PP: 125-138 |
261 |
|
|
LA: GE |
262 |
|
|
PY: 1993 |
263 |
|
|
PR: TOAPP |
264 |
|
|
LO: D |
265 |
|
|
RD: Pf |
266 |
|
|
CC: H.3.2 |
267 |
|
|
SD: file organisation |
268 |
|
|
FT: signature files; signature trees |
269 |
|
|
ED: 24.06.93 |
270 |
|
|
|
271 |
|
|
CK: Weird:?? |
272 |
|
|
AU: Äüborg |
273 |
|
|
TI: äbör ßälbär |