Sciweavers

14121 search results - page 555 / 2825
» Interval Computations in Computer Vision
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 7 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
AMC
2005
138views more  AMC 2005»
15 years 7 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
IJCV
2002
219views more  IJCV 2002»
15 years 6 months ago
View-Invariant Representation and Recognition of Actions
Analysis of human perception of motion shows that information for representing the motion is obtained from the dramatic changes in the speed and direction of the trajectory. In thi...
Cen Rao, Alper Yilmaz, Mubarak Shah
AMAI
2010
Springer
15 years 4 months ago
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CVPR
2008
IEEE
16 years 9 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert