Sciweavers

785 search results - page 91 / 157
» Embedding a Forest in a Graph
Sort
View
GG
2004
Springer
15 years 9 months ago
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
Paolo Baldan, Barbara König, Ingo Stürme...
121
Voted
PCM
2004
Springer
107views Multimedia» more  PCM 2004»
15 years 9 months ago
Complete Performance Graphs in Probabilistic Information Retrieval
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system und...
Nicu Sebe, Dionysius P. Huijsmans, Qi Tian, Theo G...
139
Voted
CATS
2006
15 years 5 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
DIMACS
1996
15 years 5 months ago
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
Bruno Courcelle
RSA
2011
126views more  RSA 2011»
14 years 11 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...