Sciweavers

14121 search results - page 162 / 2825
» Interval Computations in Computer Vision
Sort
View
PARA
2004
Springer
15 years 11 months ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson
CVPR
2006
IEEE
16 years 8 months ago
Intelligent Collaborative Tracking by Mining Auxiliary Objects
Many tracking methods face a fundamental dilemma in practice: tracking has to be computationally efficient but verifying if or not the tracker is following the true target tends t...
Ming Yang, Ying Wu, Shihong Lao
JCT
2007
112views more  JCT 2007»
15 years 6 months ago
Bruhat intervals as rooks on skew Ferrers boards
We characterise the permutations π such that the elements in the closed lower Bruhat interval [id,π] of the symmetric group correspond to non-taking rook configurations on a sk...
Jonas Sjöstrand
MICS
2010
124views more  MICS 2010»
15 years 1 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
ICPR
2002
IEEE
16 years 7 months ago
On the Equivalence of Local-Mode Finding, Robust Estimation and Mean-Shift Analysis as Used in Early Vision Tasks
In this paper we show the equivalence of three techniques used in image processing: local-mode finding, robust-estimation and mean-shift analysis. The computational common element...
Rein van den Boomgaard, Joost van de Weijer