Sciweavers

4903 search results - page 262 / 981
» The Set Covering Machine
Sort
View
ICTIR
2009
Springer
15 years 4 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
CORR
2011
Springer
156views Education» more  CORR 2011»
15 years 1 months ago
Discrete Time Elastic Vector Spaces
This paper proposes a framework dedicated to the construction of what we call time elastic inner products allowing one to embed sets of non-uniformly sampled multivariate time ser...
Pierre-François Marteau
WWW
2011
ACM
15 years 1 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
ICIP
1994
IEEE
16 years 8 months ago
Fractal-Based Techniques for a Generalized Image Coding Method
This paper presents a new generalized image block coding algorithm which covers fractal techniques, block transform techniques, and vector quantization as its special cases. The c...
Mohammad Gharavi-Alkhansari, Thomas S. Huang
SDM
2009
SIAM
108views Data Mining» more  SDM 2009»
16 years 3 months ago
Highlighting Diverse Concepts in Documents.
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
Evimaria Terzi, Kun Liu, Tyrone Grandison