Sciweavers

2766 search results - page 367 / 554
» Algorithms for trigonometric polynomials
Sort
View
CAISE
2008
Springer
15 years 6 months ago
Timed Transition Discovery from Web Service Conversation Logs
Web service business protocols are of importance to both clients and providers, as they model the external behaviour of services. However, the business protocol is not always publ...
Didier Devaurs, Kreshnik Musaraj, Fabien De Marchi...
ECML
2006
Springer
15 years 6 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
CP
2008
Springer
15 years 6 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
ECAI
2008
Springer
15 years 6 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
AMW
2010
15 years 6 months ago
Updating ABoxes in DL-Lite
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...