Sciweavers

1798 search results - page 82 / 360
» A Tree for All Seasons
Sort
View
DAGSTUHL
2006
13 years 10 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
LICS
2007
IEEE
14 years 3 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
ICCSA
2007
Springer
14 years 3 months ago
On Dynamic Multicast Trees for Stormless Binding Update in Network Mobility
Mobile IP (MIP) is designed for supporting mobile nodes. The technology does not sufficiently handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) [1] ensures session conti...
Moonseong Kim, Sungchang Lee, Hyunseung Choo
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
3DPVT
2002
IEEE
112views Visualization» more  3DPVT 2002»
14 years 1 months ago
Optimized Compression of Triangle Mesh Geometry Using Prediction Trees
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to ...
Boris Kronrod, Craig Gotsman