8780 search results - page 209 / 1756 » On the Feasibility of Consistent Computations |
204
click to vote
CAD
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
183
click to vote
ICCV
2009
IEEE
17 years 6 days ago
2009
IEEE
We propose an algorithm for large displacement opti-
cal flow estimation which does not require the commonly
used coarse-to-fine warping strategy. It is based on a
quadratic rel...
176
click to vote
TACAS
2010
Springer
16 years 2 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
186
click to vote
TACAS
2009
Springer
16 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
188
click to vote
IFIP
2009
Springer
16 years 1 months ago
2009
Springer
The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-do...