14121 search results - page 159 / 2825 » Interval Computations in Computer Vision |
168
click to vote
IJFCS
2007
15 years 6 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
159
click to vote
JAL
2007
15 years 6 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
163
click to vote
NA
2007
15 years 5 months ago
2007
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
167
click to vote
FOCI
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract— Centroid, cardinality, fuzziness, variance and skewness are all important concepts for an interval type-2 fuzzy set (IT2 FS) because they are all measures of uncertaint...
154
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
A method is proposed to generate an isolation for a plane curve, which is a set of boxes covering the curve, having the same topology as the curve, and approximating the curve to a...