Sciweavers

2566 search results - page 45 / 514
» The Online Median Problem
Sort
View
JACM
2006
92views more  JACM 2006»
13 years 10 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie
TREC
2004
14 years 5 hour ago
Concept Extraction and Synonymy Management for Biomedical Information Retrieval
This paper reports on work done for the Genomics Track at TREC 2004 by ConverSpeech LLC in conjunction with scientists at the Saccharomyces Genome Database (SGD), the model organi...
Colleen E. Crangle, Alex Zbyslaw, J. Michael Cherr...
NIPS
2004
14 years 11 hour ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
ICIP
2008
IEEE
15 years 11 days ago
Correlation-based motion vector processing for motion compensated frame interpolation
In this paper, a novel correlation-based motion vector processing method is proposed for motion compensated frame interpolation. We first address the problem of unreliable motion ...
Ai-Mei Huang, Truong Nguyen
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 5 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku