Sciweavers

54 search results - page 8 / 11
» Complexity of Hybrid Logics over Transitive Frames
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 8 months ago
The craft of model making: PSPACE bounds for non-iterative modal logics
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
Lutz Schröder, Dirk Pattinson
ICCV
2011
IEEE
12 years 7 months ago
Video Primal Sketch: A Generic Middle-Level Representation of Video
This paper presents a middle-level video representation named Video Primal Sketch (VPS), which integrates two regimes of models: i) sparse coding model using static or moving prim...
Zhi Han, Zongben Xu, Song-Chun Zhu
CGF
2008
100views more  CGF 2008»
13 years 8 months ago
Real-Time Translucent Rendering Using GPU-based Texture Space Importance Sampling
We present a novel approach for real-time rendering of translucent surfaces. The computation of subsurface scattering is performed by first converting the integration over the 3D ...
Chih-Wen Chang, Wen-Chieh Lin, Tan-Chi Ho, Tsung-S...
LICS
1994
IEEE
13 years 12 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka