Sciweavers

1447 search results - page 95 / 290
» Graphs and Path Equilibria
Sort
View
BNCOD
2004
85views Database» more  BNCOD 2004»
15 years 5 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin
CPC
2006
69views more  CPC 2006»
15 years 4 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
141
Voted
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 10 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
AINA
2007
IEEE
15 years 10 months ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo
ISW
2004
Springer
15 years 9 months ago
Using Greedy Hamiltonian Call Paths to Detect Stack Smashing Attacks
The ICAT statistics over the past few years have shown at least one out of every five CVE and CVE candidate vulnerabilities have been due to buffer overflows. This constitutes a si...
Mark Foster, Joseph N. Wilson, Shigang Chen