2294 search results - page 208 / 459 » From Path Graphs to Directed Path Graphs |
166
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
138
click to vote
ALGORITHMICA
2007
15 years 3 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
136
click to vote
PKDD
2005
Springer
15 years 8 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
132
click to vote
SCALESPACE
2005
Springer
15 years 8 months ago
2005
Springer
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
148
click to vote
FLAIRS
2008
15 years 5 months ago
2008
Storyboards are commonly known as rows of pictures, which exemplarily sketch scenes in performing arts. The rows specify the sequence of scenes. The scenes themselves are illustra...