Sciweavers

14548 search results - page 439 / 2910
» The Optimal Path-Matching Problem
Sort
View
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
15 years 9 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
ECCC
2000
140views more  ECCC 2000»
15 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
CC
2004
Springer
16 years 1 months ago
Developing a Foundation for Code Optimization
Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimizati...
Mary Lou Soffa
AUTOMATICA
2005
83views more  AUTOMATICA 2005»
15 years 7 months ago
Linear dynamic filtering with noisy input and output
State estimation problems for linear time-invariant systems with noisy inputs and outputs are considered. An efficient recursive algorithm for the smoothing problem is presented. ...
Ivan Markovsky, Bart De Moor
ICCV
2001
IEEE
16 years 9 months ago
Optimal Motion Estimation from Multiview Normalized Epipolar Constraint
In this paper, we study the structure from motion problem as a constrained nonlinear least squares problem which minimizes the so called reprojection error subject to all constrai...
René Vidal, Shankar Sastry, Shawn Hsu, Yi M...