Sciweavers

1199 search results - page 150 / 240
» Parameterized Proof Complexity
Sort
View
TGC
2010
Springer
15 years 4 months ago
Certified Result Checking for Polyhedral Analysis of Bytecode Programs
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
Frédéric Besson, Thomas P. Jensen, D...
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
DASIP
2010
15 years 1 months ago
RVC-CAL dataflow implementations of MPEG AVC/H.264 CABAC decoding
This paper describes the implementation of the MPEG AVC CABAC entropy decoder using the RVC-CAL dataflow programming language. CABAC is the Context based Adaptive Binary Arithmeti...
Endri Bezati, Marco Mattavelli, Mickaël Raule...
ICCV
1998
IEEE
16 years 8 months ago
Shape Recovery Using Dynamic Subdivision Surfaces
A new dynamic subdivision surface model is proposed for shape recovery from 3D data sets. The model inherits the attractive properties of the Catmull-Clark subdivision scheme and ...
Chhandomay Mandal, Baba C. Vemuri, Hong Qin
ICIP
2002
IEEE
16 years 7 months ago
Joint space-time image sequence segmentation based on volume competition and level sets
In this paper, we address the issue of joint space-time segmentation of image sequences. Typical approaches to such segmentation consider two image frames at a time, and perform t...
Mirko Ristivojevic, Janusz Konrad