Sciweavers

356 search results - page 23 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
Hao Wu, Aswin C. Sankaranarayanan, Rama Chellappa
EOR
2006
90views more  EOR 2006»
13 years 7 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
JIRS
2006
87views more  JIRS 2006»
13 years 7 months ago
A Comparison of Fuzzy and CPWL Approximations in the Continuous-time Nonlinear Model-predictive Control of Time-delayed Wiener-t
This paper deals with a novel method of continuous-time model-predictive control for nonlinear time-delayed systems. The problems relating to time delays are solved by incorporatin...
Simon Oblak, Igor Skrjanc
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 1 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ISBI
2009
IEEE
14 years 2 months ago
Time Resolved Fluorescence Diffuse Optical Tomography Using Multi-Resolution Exponential B-Splines
This paper deals with the problem of time-resolved fluorescence diffuse optical tomography. We propose a new reconstruction scheme based on a multi-resolution approximation of th...
Nicolas Ducros, Anabela da Silva, Jean-Marc Dinten...