4041 search results - page 761 / 809 » time 2009 |
142
click to vote
CIKM
2009
Springer
16 years 20 days ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
187
click to vote
CIKM
2009
Springer
16 years 20 days ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
188
click to vote
CIVR
2009
Springer
16 years 20 days ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
181
click to vote
CIVR
2009
Springer
16 years 20 days ago
2009
Springer
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
145
click to vote
COCO
2009
Springer
16 years 20 days ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...