Sciweavers

2252 search results - page 231 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ACCV
2007
Springer
15 years 10 months ago
Exploiting Inter-frame Correlation for Fast Video to Reference Image Alignment
Strong temporal correlation between adjacent frames of a video signal has been successfully exploited in standard video compression algorithms. In this work, we show that the tempo...
Arif Mahmood, Sohaib Khan
COLT
2007
Springer
15 years 10 months ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
Cyril Gavoille, Olivier Ly
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
15 years 7 months ago
Smaller Two-Qubit Circuits for Quantum Communication and Computation
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
Vivek V. Shende, Igor L. Markov, Stephen S. Bulloc...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 9 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza