Sciweavers

101 search results - page 4 / 21
» To Be and Not To Be: 3-Valued Relations on Graphs
Sort
View
ICSM
1997
IEEE
13 years 12 months ago
A Model for Change Propagation Based on Graph Rewriting
This paper presents a model of change propagation during software maintenance and evolution. Change propagation is modeled as a sequence of snapshots, where each snapshot represen...
Vaclav Rajlich
RSA
2010
98views more  RSA 2010»
13 years 6 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
JCT
2007
140views more  JCT 2007»
13 years 7 months ago
Homomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
Reza Naserasr
HICSS
2008
IEEE
121views Biometrics» more  HICSS 2008»
14 years 2 months ago
The Impact of Directionality in Predications on Text Mining
The number of publications in biomedicine is increasing enormously each year. To help researchers digest the information in these documents, text mining tools are being developed ...
Gondy Leroy, Marcelo Fiszman, Thomas C. Rindflesch
CIARP
2009
Springer
13 years 5 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar