Sciweavers

46 search results - page 4 / 10
» A Discovery Algorithm for Directed Cyclic Graphs
Sort
View
DCC
2007
IEEE
15 years 9 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
UAI
2008
14 years 11 months ago
Almost Optimal Intervention Sets for Causal Discovery
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
Frederick Eberhardt
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
15 years 4 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
14 years 11 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
WWW
2008
ACM
15 years 10 months ago
Web video topic discovery and tracking via bipartite graph reinforcement model
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
Lu Liu, Lifeng Sun, Yong Rui, Yao Shi, Shiqiang Ya...