2304 search results - page 174 / 461 » On the Vulnerability of Large Graphs |
161
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
This paper presents efficient automatic code synthesis techniques from dataflow graphs for multimedia applications. Since multimedia applications require large size buffers contai...
173
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
159
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
210
click to vote
AUSAI
2009
Springer
16 years 1 months ago
2009
Springer
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
174
click to vote
AGTIVE
2007
Springer
16 years 22 days ago
2007
Springer
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A...