Sciweavers

3466 search results - page 490 / 694
» Fast computation of special resultants
Sort
View
EOR
2007
69views more  EOR 2007»
15 years 6 months ago
Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
— We describe a solution procedure for a special case of the periodic vehicle routing problem (PVRP). Operation managers at an auto parts in the north of Spain described the opti...
Jesús F. Alegre, Manuel Laguna, Joaqu&iacut...
MVA
2008
201views Computer Vision» more  MVA 2008»
15 years 6 months ago
How close are we to solving the problem of automated visual surveillance?
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
Hannah M. Dee, Sergio A. Velastin
NECO
2008
108views more  NECO 2008»
15 years 6 months ago
Optimal Approximation of Signal Priors
In signal restoration by Bayesian inference, one typically uses a parametric model of the prior distribution of the signal. Here, we consider how the parameters of a prior model s...
Aapo Hyvärinen
NETWORKS
2008
15 years 6 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
IPL
2007
111views more  IPL 2007»
15 years 6 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov