5606 search results - page 610 / 1122 » Randomization Techniques for Graphs. |
186
click to vote
FMCO
2003
Springer
16 years 8 days ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
237
click to vote
SCAM
2002
IEEE
15 years 12 months ago
2002
IEEE
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
169
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
183
click to vote
CVPR
1997
IEEE
15 years 11 months ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
162
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...