Sciweavers

977 search results - page 75 / 196
» Permuting Web Graphs
Sort
View
SAT
2009
Springer
117views Hardware» more  SAT 2009»
15 years 6 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
AAAI
2007
15 years 2 months ago
A Planning Approach for Message-Oriented Semantic Web Service Composition
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
Zhen Liu, Anand Ranganathan, Anton Riabov
WWW
2004
ACM
16 years 16 days ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
SEMWEB
2007
Springer
15 years 6 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
ECML
1998
Springer
15 years 4 months ago
First-Order Learning for Web Mining
We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in ...
Mark Craven, Seán Slattery, Kamal Nigam