2498 search results - page 430 / 500 » Data Structures with Unpredictable Timing |
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
106
click to vote
TACAS
2001
Springer
15 years 2 months ago
2001
Springer
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
The problem of face identification has received significant attention over the years. For a given probe face, the goal of face identification is to match this unknown face against ...
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...