3775 search results - page 65 / 755 » The Expression Problem Revisited |
121
Voted
ECIR
2007
Springer
15 years 2 months ago
2007
Springer
We discuss the idea of modelling the statistical distributions of scores of documents, classified as relevant or non-relevant. Various specific combinations of standard statistic...
NETWORKING
2008
15 years 2 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
DLOG
2010
14 years 10 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
112
click to vote
JMLR
2010
14 years 7 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
75
Voted
SIGECOM
2004
ACM
15 years 6 months ago
2004
ACM
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...