Sciweavers

530 search results - page 36 / 106
» Structural and Complexity Aspects of Line Systems of Graphs
Sort
View
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 4 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
121
Voted
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 2 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
109
Voted
KBSE
2005
IEEE
15 years 7 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
SAC
2010
ACM
15 years 7 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
ICIP
2008
IEEE
16 years 3 months ago
Graph-based deinterlacing
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
Jérôme Roussel, Pascal Bertolino