1402 search results - page 6 / 281 » Sparse-Memory Graph Search |
IPL
2010
14 years 8 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
103
click to vote
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...