3113 search results - page 517 / 623 » Efficiently Generating Efficient Generating Extensions in Pr... |
123
Voted
IADIS
2008
15 years 5 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
138
Voted
IJCAI
2001
15 years 5 months ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
144
Voted
WSMAI
2004
15 years 5 months ago
2004
Continuous Queries (CQ) help users to retrieve results as soon as they become available. The CQ keeps track of two important events. If there is any change in the source informatio...
116
Voted
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
136
Voted
CGF
2008
15 years 3 months ago
2008
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...