Sciweavers

9359 search results - page 11 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
JCDL
2010
ACM
156views Education» more  JCDL 2010»
13 years 9 months ago
Interactively browsing movies in terms of action, foreshadowing and resolution
We describe a novel video player that uses Temporal Semantic Compression (TSC) to present a compressed summary of a movie. Compression is based on tempo which is derived from film...
Stewart Greenhill, Brett Adams, Svetha Venkatesh
SIGIR
2005
ACM
14 years 2 months ago
A Markov random field model for term dependencies
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
Donald Metzler, W. Bruce Croft
TSP
2008
110views more  TSP 2008»
13 years 8 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
ICTIR
2009
Springer
14 years 3 months ago
"A term is known by the company it keeps": On Selecting a Good Expansion Set in Pseudo-Relevance Feedback
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
Raghavendra Udupa, Abhijit Bhole, Pushpak Bhattach...
JGO
2010
100views more  JGO 2010»
13 years 3 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti