1898 search results - page 274 / 380 » Weak Keys for IDEA |
RTA
1995
Springer
14 years 1 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
FASE
2010
Springer
14 years 1 months ago
2010
Springer
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
AAAI
2007
14 years 10 days ago
2007
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. In this paper we propose a mean of performing automated Web service ...
AAAI
2007
14 years 10 days ago
2007
Recent studies have shown that graph-based approaches are effective for semi-supervised learning. The key idea behind many graph-based approaches is to enforce the consistency bet...
AAAI
2008
14 years 10 days ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...