1402 search results - page 162 / 281 » Sparse-Memory Graph Search |
103
Voted
BMVC
2001
15 years 5 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
116
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
120
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
149
Voted
AIPS
2006
15 years 4 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
123
click to vote
AI
2008
Springer
15 years 2 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...