Sciweavers

1756 search results - page 94 / 352
» Directed scale-free graphs
Sort
View
CG
2008
Springer
13 years 10 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
CN
1999
56views more  CN 1999»
13 years 7 months ago
Surfing the Web Backwards
From a user's perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering "backlinks&qu...
Soumen Chakrabarti, David Gibson, Kevin S. McCurle...
IPMU
2010
Springer
13 years 6 months ago
Possibilistic Graphical Models and Compositional Models
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...
Jirina Vejnarová
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Beware of the DAG!
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
A. Philip Dawid
ICALP
2003
Springer
14 years 1 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren