1983 search results - page 35 / 397 » Competitive graph searches |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
CCCG
2003
13 years 9 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
COMMA
2008
13 years 9 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...