3819 search results - page 240 / 764 » Simple Easy Terms |
172
click to vote
SIGIR
2004
ACM
16 years 19 days ago
2004
ACM
We describe an evaluation of result set filtering techniques for providing ultra-high precision in the task of presenting related news for general web queries. In this task, the n...
248
click to vote
SIGIR
2004
ACM
16 years 19 days ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
192
click to vote
CIKM
2000
Springer
15 years 11 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
176
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
188
click to vote
NIPS
1994
15 years 8 months ago
1994
Ideally pattern recognition machines provide constant output when the inputs are transformed under a group G of desired invariances. These invariances can be achieved by enhancing...