Sciweavers

5263 search results - page 405 / 1053
» Open Constraint Optimization
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
185
Voted
ICIP
1998
IEEE
16 years 8 months ago
A Fast and Robust Point Tracking Algorithm
We present an algorithm that efficiently tracks a predefined set of landmark points in a time sequence of images. The algorithm iteratively optimizes the correspondences between t...
Cor J. Veenman, Emile A. Hendriks, Marcel J. T. Re...
FOCS
1991
IEEE
15 years 10 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
CVGIP
2002
85views more  CVGIP 2002»
15 years 6 months ago
Minimizing the Distortion of Affine Spline Motions
This paper proposes a simple approach to the affine motion interpolation problem, where an affine spline motion is generated that interpolates a given sequence of affine keyframes...
Dae-Eun Hyun, Bert Jüttler, Myung-Soo Kim
ICASSP
2011
IEEE
14 years 10 months ago
Linear precoding for time-varying MIMO channels with low-complexity receivers
This paper considers linear precoding for time-varying multipleinput multiple-output (MIMO) channels. We show that linear minimum mean-squared error (LMMSE) equalization based on ...
Jun Tong, Peter J. Schreier, Steven R. Weller, Lou...