1983 search results - page 41 / 397 » Competitive graph searches |
GEM
2007
13 years 9 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
IJCAI
2007
13 years 9 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we investigate how to scale a content based image retrieval approach beyond the RAM limits of a single computer and to make use of its hard drive to store the featur...
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...