1254 search results - page 225 / 251 » Making Hard Problems Harder |
109
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
114
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Text mining, though still a nascent industry, has been growing quickly along with the awareness of the importance of unstructured data in business analytics, customer retention an...
105
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
124
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
129
click to vote
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...