Sciweavers

620 search results - page 107 / 124
» Algorithms for Rewriting Aggregate Queries Using Views
Sort
View
134
Voted
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 9 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
SIGIR
2011
ACM
14 years 5 months ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel
126
Voted
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 2 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 5 months ago
Temporal Analytics on Big Data for Web Advertising
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
Badrish Chandramouli, Jonathan Goldstein, Songyun ...
110
Voted
STACS
2007
Springer
15 years 8 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom