Sciweavers

469 search results - page 20 / 94
» Directed Graphs of Entanglement Two
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 5 days ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
ER
2005
Springer
200views Database» more  ER 2005»
15 years 5 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
WEBI
2001
Springer
15 years 4 months ago
Average-Clicks: A New Measure of Distance on the World Wide Web
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
ICALP
2010
Springer
15 years 3 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
101
Voted
EACL
1989
ACL Anthology
15 years 28 days ago
Extended Graph Unification
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
Allan Ramsay