Sciweavers

5169 search results - page 141 / 1034
» Locality approximation using time
Sort
View
MICS
2010
137views more  MICS 2010»
15 years 3 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 11 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
IFIPTCS
2010
15 years 2 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
ISBI
2008
IEEE
16 years 5 months ago
Improving single particle localization with an empirically calibrated Gaussian kernel
Accurate computational localization of single fluorescent particles is of interest to many biophysical studies and underlies recent approaches to high resolution microscopy using ...
Marcio de Moraes Marim, Bo Zhang, Jean-Christophe ...
CVPR
2011
IEEE
14 years 8 months ago
Fusion of GPS and Structure-from-Motion using Constrained Bundle Adjustments
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...
Maxime Lhuillier