3514 search results - page 507 / 703 » A search space |
143
Voted
CADE
2005
Springer
16 years 1 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
190
Voted
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
188
Voted
SIGMOD
2008
ACM
16 years 29 days ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
109
click to vote
MICCAI
2009
Springer
15 years 10 months ago
2009
Springer
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
118
Voted
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...