4972 search results - page 231 / 995 » Ranking on graph data |
178
click to vote
CIKM
2005
Springer
16 years 6 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
138
click to vote
IRI
2005
IEEE
16 years 7 days ago
2005
IEEE
Abstract)",4th Annual Walter Lincoln Hawkins Research Conference, RPI, November 2005. B. Hill, \Correlated Caching for Correlated Data", 2nd Annual Walter Lincoln Hawkins...
178
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
169
click to vote
PVLDB
2010
15 years 5 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
203
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...