7215 search results - page 216 / 1443 » On the Consistency of Ranking Algorithms |
ICCBR
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
ICWE
2010
Springer
14 years 1 months ago
2010
Springer
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
COMAD
2009
13 years 9 months ago
2009
Terms in textual documents tend to occur more in contexts to which they are related. We can exploit this bias by modelling terms and their cooccurrences s, resembling the abstract...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Bursty features in text streams are very useful in many text mining applications. Most existing studies detect bursty features based purely on term frequency changes without takin...