Sciweavers

2125 search results - page 148 / 425
» On Graph Complexity
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 3 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
102
Voted
SIAMDM
2010
140views more  SIAMDM 2010»
14 years 8 months ago
Retractions to Pseudoforests
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
Tomás Feder, Pavol Hell, Peter Jonsson, And...
92
Voted
JMLR
2010
118views more  JMLR 2010»
14 years 5 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
GPEM
2007
95views more  GPEM 2007»
14 years 10 months ago
Where is evolutionary computation going? A temporal analysis of the EC community
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
Carlos Cotta, Juan Julián Merelo Guerv&oacu...
ICFP
2007
ACM
15 years 10 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni