5158 search results - page 245 / 1032 » Generalization of the Dempster-Shafer Theory |
194
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
169
click to vote
CCS
2009
ACM
16 years 7 months ago
2009
ACM
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
188
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
152
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
239
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...