Sciweavers

1756 search results - page 137 / 352
» Directed scale-free graphs
Sort
View
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 2 months ago
Temporal Analysis of Semantic Graphs Using ASALSAN
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
Brett W. Bader, Richard A. Harshman, Tamara G. Kol...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 2 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ICALP
2010
Springer
14 years 28 days ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
AAAI
2008
13 years 10 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
KRDB
1998
83views Database» more  KRDB 1998»
13 years 9 months ago
Semantic Query Optimisation and Rule Graphs
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
Jerome Robinson, Barry G. T. Lowden