1402 search results - page 147 / 281 » Sparse-Memory Graph Search |
105
click to vote
CVIU
2008
15 years 2 months ago
2008
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
122
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
129
click to vote
AIPS
2008
15 years 4 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
111
Voted
ALENEX
2007
15 years 3 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
149
Voted
VIS
2009
IEEE
16 years 3 months ago
2009
IEEE
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...