2100 search results - page 384 / 420 » Learning to rank on graphs |
116
click to vote
SIGIR
2011
ACM
14 years 4 months ago
2011
ACM
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
128
Voted
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
122
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We propose a space-time Markov Random Field (MRF)
model to detect abnormal activities in video. The nodes in
the MRF graph correspond to a grid of local regions in the
video fra...
136
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
132
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...