8917 search results - page 1526 / 1784 » Abstraction in Algorithm Animation |
100
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
129
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
140
click to vote
EMMCVPR
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
147
click to vote
GD
1997
Springer
15 years 8 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
164
click to vote
ISMIS
1997
Springer
15 years 8 months ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...