Sciweavers

699 search results - page 79 / 140
» Ranking of Object Summaries
Sort
View
CIVR
2009
Springer
141views Image Analysis» more  CIVR 2009»
15 years 3 months ago
Automatic retrieval of visual continuity errors in movies
Continuity errors occur in many movies and television series, in spite of careful checking by those employed to minimise them. In this work we develop a scheme for automatically d...
Lyndsey C. Pickup, Andrew Zisserman
ICASSP
2011
IEEE
14 years 4 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 22 days ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SIGIR
2009
ACM
15 years 7 months ago
Measuring the descriptiveness of web comments
This paper investigates whether Web comments are of descriptive nature, that is, whether the combined text of a set of comments is similar in topic to the commented object. If so,...
Martin Potthast
76
Voted
CP
2005
Springer
15 years 6 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser