62 search results - page 6 / 13 » Learnability of Term Rewrite Systems from Positive Examples |
LRE
2006
13 years 6 months ago
2006
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
TSE
1998
13 years 6 months ago
1998
—Scenarios are increasingly recognized as an effective means for eliciting, validating, and documenting software requirements. This paper concentrates on the use of scenarios for...
HUC
2010
Springer
13 years 5 months ago
2010
Springer
This paper introduces an algorithm that estimates the speed of a mobile phone by matching time-series signal strength data to a known signal strength trace from the same road. Kno...
LPAR
2004
Springer
14 years 1 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
CCS
2011
ACM
12 years 6 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...