5606 search results - page 384 / 1122 » Randomization Techniques for Graphs. |
161
click to vote
GD
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
197
click to vote
GG
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
201
Voted
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...
183
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Defect localisation is essential in software engineering and is an important task in domain-specific data mining. Existing techniques building on call-graph mining can localise dif...
237
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...