1047 search results - page 45 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
AIED
2005
Springer
14 years 1 months ago
2005
Springer
This paper explores the idea of using contexts to support more efficient information search in Topic Maps-based digital libraries. The notion of context is d as abstraction of grou...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...