Sciweavers

62 search results - page 6 / 13
» Online paging with arbitrary associativity
Sort
View
RECSYS
2010
ACM
15 years 6 months ago
Global budgets for local recommendations
We present the design, implementation and evaluation of a new geotagging service, Gloe, that makes it easy to find, rate and recommend arbitrary on-line content in a mobile settin...
Thomas Sandholm, Hang Ung, Christina Aperjis, Bern...
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 8 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 7 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
JDWM
2010
139views more  JDWM 2010»
15 years 4 months ago
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
Panagiotis Giannikopoulos, Iraklis Varlamis, Magda...
ICPR
2010
IEEE
15 years 6 months ago
Images in News
A system, called NewsStand, is introduced that automatically extracts images from news articles. The system takes RSS feeds of news article and applies an online clustering algori...
Jagan Sankaranarayanan, Hanan Samet