Sciweavers

35 search results - page 6 / 7
» A Competitive Analysis of the List Update Problem with Looka...
Sort
View
CIVR
2010
Springer
204views Image Analysis» more  CIVR 2010»
13 years 11 months ago
Utilizing related samples to learn complex queries in interactive concept-based video search
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
Jin Yuan, Zheng-Jun Zha, Zhengdong Zhao, Xiangdong...
SIGIR
2009
ACM
14 years 2 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra
CF
2009
ACM
14 years 9 days ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine