5607 search results - page 847 / 1122 » Graph structure in the Web |
158
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
205
click to vote
FDL
2004
IEEE
15 years 10 months ago
2004
IEEE
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
171
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...
168
click to vote
ISAAC
1995
Springer
15 years 10 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
179
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Even a relatively unstructured captioned image set depicting a variety of objects in cluttered scenes contains strong correlations between caption words and repeated visu...